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 Shortest Path Based Graph Orientations

Dima Blokh, Danny Segev, Roded Sharan. Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations. In Juha Kärkkäinen, Jens Stoye, editors, Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings. Volume 7354 of Lecture Notes in Computer Science, pages 70-82, Springer, 2012. [doi]

Authors

Dima Blokh

This author has not been identified. Look up 'Dima Blokh' in Google

Danny Segev

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

Roded Sharan

This author has not been identified. Look up 'Roded Sharan' in Google
runs on