Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations Dima Blokh1 Danny Segev2 Roded Sharan1 1. School of Computer Science, Tel Aviv University, 2. Department of Statistics, University

First Page		Document Content
Date: 2012-12-29 15:22:26 Network theory Graph connectivity Shortest path problem Path Graph theory Mathematics Theoretical computer science		Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations Dima Blokh1 Danny Segev2 Roded Sharan1 1. School of Computer Science, Tel Aviv University, 2. Department of Statistics, University Add to Reading List Source URL: www.cs.ucr.edu Download Document from Source Website File Size: 262,44 KB Share Document on Facebook