Approximation algorithms and hardness results for shortest path based graph orientations

D Blokh, D Segev, R Sharan - … , CPM 2012, Helsinki, Finland, July 3-5 …, 2012 - Springer
The graph orientation problem calls for orienting the edges of an undirected graph so as to
maximize the number of pre-specified source-target vertex pairs that admit a directed path …
被引用次数：5 相关文章

Approximation algorithms and hardness results for shortest path based graph orientations

D Blokh, D Segev, R Sharan - … of the 23rd Annual conference on …, 2012 - dl.acm.org
The graph orientation problem calls for orienting the edges of an undirected graph so as to
maximize the number of pre-specified source-target vertex pairs that admit a directed path …

Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

D Blokh, D Segev, R Sharan - … 2012, Helsinki, Finland, July 3-5 …, 2012 - books.google.com
The graph orientation problem calls for orienting the edges of an undirected graph so as to
maximize the number of pre-specified source-target vertex pairs that admit a directed path …
[PDF] tau.ac.il

[PDF][PDF] Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

D Blokh, D Segev, R Sharan - math.tau.ac.il
The graph orientation problem calls for orienting the edges of an undirected graph so as to
maximize the number of pre-specified source-target vertex pairs that admit a directed path …

Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

D Blokh, D Segev, R Sharan - Combinatorial Pattern Matching - Springer
The graph orientation problem calls for orienting the edges of an undirected graph so as to
maximize the number of pre-specified source-target vertex pairs that admit a directed path …
[PDF] psu.edu

[PDF][PDF] Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

D Blokh, D Segev, R Sharan - Citeseer
The graph orientation problem calls for orienting the edges of an undirected graph so as to
maximize the number of pre-specified source-target vertex pairs that admit a directed path …
[PDF] tau.ac.il

[PDF][PDF] Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

D Blokh, D Segev, R Sharan - cs.tau.ac.il
The graph orientation problem calls for orienting the edges of an undirected graph so as to
maximize the number of pre-specified source-target vertex pairs that admit a directed path …

[引用][C] Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

D Blokh, D Segev, R Sharan - Combinatorial Pattern Matching, 2012 - Springer