Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems.
Venkatesan GuruswamiSanjeev KhannaRajmohan RajaramanF. Bruce ShepherdMihalis YannakakisPublished in: J. Comput. Syst. Sci. (2003)
Keyphrases
- disjoint paths
- related problems
- approximation algorithms
- np hard
- np hardness
- worst case
- special case
- network design problem
- minimum cost
- undirected graph
- approximation ratio
- open shop
- lower bound
- facility location problem
- primal dual
- approximation schemes
- vertex cover
- computational complexity
- np complete
- constant factor
- set cover
- optimal solution
- phase transition
- directed graph
- scheduling problem
- randomized algorithms
- agnostic learning
- search algorithm
- integer programming
- precedence constraints
- approximation guarantees