Advertisement

Abstract

In the Binary Paintshop problem, there are m cars appearing in a sequence of length 2m, with each car occurring twice. Each car needs to be colored with two colors. The goal is to choose for each car, which of its occurrences receives either color, so as to minimize the total number of color changes in the sequence. We show that the Binary Paintshop problem is equivalent (up to constant factors) to the Minimum Uncut problem, under randomized reductions. By derandomizing this reduction for hard instances of the Min Uncut problem arising from the Unique Games Conjecture, we show that the Binary Paintshop problem is ω(1)-hard to approximate (assuming the UGC). This answers an open question from [BEH06,MS09,AH11].

Keywords

Random Permutation Constraint Graph Opposite Color Majority Color Parallel Repetition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ACMM05.
    Agarwal, A., Charikar, M., Makarychev, K., Makarychev, Y.: \(O(\sqrt{\log n})\) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. In: 37th Annual ACM Symposium on Theory of Computing, pp. 573–581 (2005)Google Scholar
  2. AH11.
    Andres, S.D., Hochstättler, W.: Some heuristics for the binary paint shop problem and their expected number of colour changes. J. Discrete Algorithms 9(2), 203–211 (2011)MathSciNetzbMATHCrossRefGoogle Scholar
  3. AMMM10.
    Amini, H., Meunier, F., Michel, H., Mohajeri, A.: Greedy colorings for the binary paintshop problem. Journal of Discrete Algorithms 8(1), 8–14 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  4. BEH06.
    Bonsma, P.S., Epping, T., Hochstättler, W.: Complexity results on restricted instances of a paint shop problem for words. Discrete Applied Mathematics 154(9), 1335–1343 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  5. Din07.
    Dinur, I.: The PCP theorem by gap amplification. Journal of the ACM 54(3), 12 (2007)MathSciNetCrossRefGoogle Scholar
  6. EHO01.
    Epping, T., Hochstättler, W., Oertel, P.: Some results on a Paint Shop problem for words. Electronic Notes in Discrete Mathematics 8, 31–33 (2001)CrossRefGoogle Scholar
  7. Kho02.
    Khot, S.: On the power of unique 2-prover 1-round games. In: 34th Annual ACM Symposium on the Theory of Computing, pp. 767–775 (July 2002)Google Scholar
  8. KKMO07.
    Khot, S., Kindler, G., Mossel, E., O’Donnell, R.: Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput. 37(1), 319–357 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  9. MS09.
    Meunier, F., Sebö, A.: Paintshop, odd cycles and necklace splitting. Discrete Applied Mathematics 157(4), 780–793 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  10. Raz98.
    Raz, R.: A parallel repetition theorem. SIAM Journal of Computing 27(3), 763–803 (1998)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Anupam Gupta
    • 1
  • Satyen Kale
    • 2
  • Viswanath Nagarajan
    • 2
  • Rishi Saket
    • 2
  • Baruch Schieber
    • 2
  1. 1.Dept. of Computer ScienceCarnegie Mellon UniversityPittsburghUSA
  2. 2.IBM T.J. Watson Research CenterYorktown HeightsUSA

Personalised recommendations