Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations.
Dima BlokhDanny SegevRoded SharanPublished in: CPM (2012)
Keyphrases
- approximation algorithms
- np hard
- undirected graph
- worst case
- np hardness
- constant factor
- special case
- disjoint paths
- open shop
- minimum cost
- directed graph
- shortest path
- primal dual
- facility location problem
- approximation ratio
- graph structure
- set cover
- weighted graph
- path length
- randomized algorithms
- network design problem
- graph model
- directed acyclic graph
- vertex cover
- np complete
- optimal solution
- computational complexity
- graph matching
- random walk
- scheduling problem
- lower bound
- precedence constraints
- spanning tree
- integer programming
- bipartite graph
- connected components
- greedy heuristic
- polynomial time approximation
- constant factor approximation