External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Approximability of the Binary Paintshop Problem

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]

Authors

Anupam Gupta

This author has not been identified. Look up 'Anupam Gupta' in Google

Satyen Kale

This author has not been identified. Look up 'Satyen Kale' in Google

Viswanath Nagarajan

This author has not been identified. Look up 'Viswanath Nagarajan' in Google

Rishi Saket

This author has not been identified. Look up 'Rishi Saket' in Google

Baruch Schieber

This author has not been identified. Look up 'Baruch Schieber' in Google
runs on