Paintshop, odd cycles and necklace splitting

• Authors: Frédéric Meunier;András Seb
• Venue: Discrete Applied Mathematics
• Year: 2009

The following problem has been presented in [T. Epping, W. Hochstattler, P. Oertel, Complexity results on a paint shop problem, Discrete Applied Mathematics 136 (2004) 217-226] by Epping, Hochstattler and Oertel: cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color changes. More generally, the ''paint shop scheduling problem'' is defined with an arbitrary multiset of colors given for each car, where this multiset has the same size as the number of occurrences of the car; the mentioned article states two conjectures about the general problem and proves its NP-hardness. In a subsequent paper in [P. Bonsma, Th. Epping, W. Hochstattler, Complexity results for restricted instances of a paint shop problem for words, Discrete Applied Mathematics 154 (2006) 1335-1343], Bonsma, Epping and Hochstattler proved its APX-hardness and noticed the applicability of some classical results in special cases. We first identify the problem concerning two colors as a minimum odd circuit cover problem in particular graphs, exactly situating the problem. A resulting two-way reduction to a special minimum uncut problem leads to polynomial algorithms for subproblems, to observing APX-hardness through MAX CUT in 3-regular graphs, and to a solution with at most 3/4th of all possible remaining color changes (when all obliged color changes have been made). For the general problem concerning an arbitrary number of colors, we realize that the two aforementioned conjectures are corollaries of the celebrated ''necklace splitting'' theorem of Alon, Goldberg and West.