Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized coloring problems on chordal graphs
Theoretical Computer Science - Parameterized and exact computation
Constrained Clustering: Advances in Algorithms, Theory, and Applications
Constrained Clustering: Advances in Algorithms, Theory, and Applications
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
On problems without polynomial kernels
Journal of Computer and System Sciences
Local search: is brute-force avoidable?
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Local search: is brute-force avoidable?
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On the complexity of some colorful problems parameterized by treewidth
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
On the hardness of reoptimization
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Minimal cost reconfiguration of data placement in storage area network
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Searching the k-change neighborhood for TSP is W[1]-hard
Operations Research Letters
Incremental list coloring of graphs, parameterized by conservation
Theoretical Computer Science
Hi-index | 0.00 |
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that each vertex has one of the colors specified by its associated list containing some of in total k colors We introduce the “conservative version” of this problem by adding a further parameter c∈ℕ specifying the maximum number of vertices to be recolored between two subsequent graphs (differing by one vertex) This “conservation parameter” c models the natural quest for a modest evolution of the coloring in the course of the incremental process instead of performing radical changes We show that the problem is NP-hard for k≥3 and W[1]-hard when parameterized by c In contrast, the problem becomes fixed-parameter tractable with respect to the combined parameter (k,c) We prove that the problem has an exponential-size kernel with respect to (k,c) and there is no polynomial-size kernel unless NP⊆coNP/poly Finally, we provide empirical findings for the practical relevance of our approach in terms of an effective graph coloring heuristic.