An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
Information Processing Letters
Handbook of combinatorics (vol. 2)
Handbook of combinatorics (vol. 2)
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Some APX-completeness results for cubic graphs
Theoretical Computer Science
Complexity results on a paint shop problem
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Some heuristics for the binary paint shop problem and their expected number of colour changes
Journal of Discrete Algorithms
Computing solutions of the paintshop-necklace problem
Computers and Operations Research
Note: Greedy colorings of words
Discrete Applied Mathematics
Hi-index | 0.00 |
We study the following problem: an instance is a word with every letter occurring twice. A solution is a 2-coloring of its letters such that the two occurrences of every letter are colored with different colors. The goal is to minimize the number of color changes between adjacent letters. This is a special case of the paint shop problem for words, which was previously shown to be NP-complete. We show that this special case is also NP-complete and even APX-hard. Furthermore, derive lower bounds for this problem and discuss a transformation into matroid theory enabling us to solve some specific instances within polynomial time.