Complexity results for restricted instances of a paint shop problem

@inproceedings{Bonsma2003ComplexityRF,
  title={Complexity results for restricted instances of a paint shop problem},
  author={Paul S. Bonsma},
  year={2003}
}
We study the following problem: an instance is a word with every letter occurring twice. A solution is a 2-coloring of the letters in the word 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, which was previously shown to be NP-hard. We show that this special case is also NP-hard and even APX -hard. 

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Similar Papers

Loading similar papers…