Complexity results on restricted instances of a paint shop problem for words

Authors:
P. Bonsma;Th. Epping;W. Hochstättler
Affiliations:
Department of Applied Mathematics, University of Twente, AE Enschede, The Netherlands;Department of Mathematics, BTU Cottbus, Germany;Fern Universität in Hagen, Hagen, Germany
Venue:
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Year:
2006

Citing 5
Cited 3

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)

Paintshop, odd cycles and necklace splitting

Discrete Applied Mathematics
Greedy colorings for the binary paintshop problem

Journal of Discrete Algorithms
Complexity issues in vertex-colored graph pattern matching

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.