ScienceGate
Advanced Search
Author Search
Journal Finder
Blog
Sign in / Sign up
ScienceGate
Search
Author Search
Journal Finder
Blog
Sign in / Sign up
The Approximability of the Binary Paintshop Problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science
◽
10.1007/978-3-642-40328-6_15
◽
2013
◽
pp. 205-217
◽
Cited By ~ 1
Author(s):
Anupam Gupta
◽
Satyen Kale
◽
Viswanath Nagarajan
◽
Rishi Saket
◽
Baruch Schieber
Download Full-text
Sign in / Sign up
Close
Export Citation Format
Close
Share Document
Close