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.

Approximation Algorithms and Hardness Results for Labeled Connectivity Problems

Refael Hassin, Jérôme Monnot, Danny Segev. Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. In Rastislav Kralovic, Pawel Urzyczyn, editors, Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings. Volume 4162 of Lecture Notes in Computer Science, pages 480-491, Springer, 2006. [doi]

Authors

Refael Hassin

This author has not been identified. Look up 'Refael Hassin' in Google

Jérôme Monnot

This author has not been identified. Look up 'Jérôme Monnot' in Google

Danny Segev

This author has not been identified. Look up 'Danny Segev' in Google
runs on