{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:41:20Z","timestamp":1725745280940},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403279"},{"type":"electronic","value":"9783642403286"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40328-6_15","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T09:17:34Z","timestamp":1376644654000},"page":"205-217","source":"Crossref","is-referenced-by-count":1,"title":["The Approximability of the Binary Paintshop Problem"],"prefix":"10.1007","author":[{"given":"Anupam","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Satyen","family":"Kale","sequence":"additional","affiliation":[]},{"given":"Viswanath","family":"Nagarajan","sequence":"additional","affiliation":[]},{"given":"Rishi","family":"Saket","sequence":"additional","affiliation":[]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Charikar, M., Makarychev, K., Makarychev, Y.: \n                    \n                      \n                    \n                    $O(\\sqrt{\\log n})$\n                   approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. In: 37th Annual ACM Symposium on Theory of Computing, pp. 573\u2013581 (2005)","DOI":"10.1145\/1060590.1060675"},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.jda.2010.12.003","volume":"9","author":"S.D. Andres","year":"2011","unstructured":"Andres, S.D., Hochst\u00e4ttler, W.: Some heuristics for the binary paint shop problem and their expected number of colour changes. J. Discrete Algorithms\u00a09(2), 203\u2013211 (2011)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.jda.2008.05.002","volume":"8","author":"H. Amini","year":"2010","unstructured":"Amini, H., Meunier, F., Michel, H., Mohajeri, A.: Greedy colorings for the binary paintshop problem. Journal of Discrete Algorithms\u00a08(1), 8\u201314 (2010)","journal-title":"Journal of Discrete Algorithms"},{"issue":"9","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1016\/j.dam.2005.05.033","volume":"154","author":"P.S. Bonsma","year":"2006","unstructured":"Bonsma, P.S., Epping, T., Hochst\u00e4ttler, W.: Complexity results on restricted instances of a paint shop problem for words. Discrete Applied Mathematics\u00a0154(9), 1335\u20131343 (2006)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1236457.1236459","volume":"54","author":"I. Dinur","year":"2007","unstructured":"Dinur, I.: The PCP theorem by gap amplification. Journal of the ACM\u00a054(3), 12 (2007)","journal-title":"Journal of the ACM"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S1571-0653(05)80072-1","volume":"8","author":"T. Epping","year":"2001","unstructured":"Epping, T., Hochst\u00e4ttler, W., Oertel, P.: Some results on a Paint Shop problem for words. Electronic Notes in Discrete Mathematics\u00a08, 31\u201333 (2001)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: 34th Annual ACM Symposium on the Theory of Computing, pp. 767\u2013775 (July 2002)","DOI":"10.1145\/510014.510017"},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/S0097539705447372","volume":"37","author":"S. Khot","year":"2007","unstructured":"Khot, S., Kindler, G., Mossel, E., O\u2019Donnell, R.: Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput.\u00a037(1), 319\u2013357 (2007)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1016\/j.dam.2008.06.017","volume":"157","author":"F. Meunier","year":"2009","unstructured":"Meunier, F., Seb\u00f6, A.: Paintshop, odd cycles and necklace splitting. Discrete Applied Mathematics\u00a0157(4), 780\u2013793 (2009)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/S0097539795280895","volume":"27","author":"R. Raz","year":"1998","unstructured":"Raz, R.: A parallel repetition theorem. SIAM Journal of Computing\u00a027(3), 763\u2013803 (1998)","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40328-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T13:43:24Z","timestamp":1558014204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40328-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403279","9783642403286"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40328-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}