Anupam Gupta, Satyen Kale, Viswanath Nagarajan, Rishi Saket, Baruch Schieber. The Approximability of the Binary Paintshop Problem. In Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D. P. Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings. Volume 8096 of Lecture Notes in Computer Science, pages 205-217, Springer, 2013. [doi]
@inproceedings{GuptaKNSS13,
title = {The Approximability of the Binary Paintshop Problem},
author = {Anupam Gupta and Satyen Kale and Viswanath Nagarajan and Rishi Saket and Baruch Schieber},
year = {2013},
doi = {10.1007/978-3-642-40328-6_15},
url = {http://dx.doi.org/10.1007/978-3-642-40328-6_15},
researchr = {https://researchr.org/publication/GuptaKNSS13},
cites = {0},
citedby = {0},
pages = {205-217},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings},
editor = {Prasad Raghavendra and Sofya Raskhodnikova and Klaus Jansen and José D. P. Rolim},
volume = {8096},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-40327-9},
}