Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke Decompositions.
Matthew AndrewsPublished in: FOCS (2010)
Keyphrases
- disjoint paths
- approximation algorithms
- np hard
- special case
- undirected graph
- minimum cost
- facility location problem
- network design problem
- vertex cover
- worst case
- open shop
- approximation ratio
- randomized algorithms
- primal dual
- set cover
- constant factor
- combinatorial auctions
- search algorithm
- polynomial time approximation
- scheduling problem
- probabilistic model
- constant factor approximation