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]

Abstract

Abstract is missing.