Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints
Longkun GuoHong ShenKewen LiaoPublished in: CoRR (2013)
Keyphrases
- disjoint paths
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- primal dual
- minimum cost
- undirected graph
- precedence constraints
- approximation ratio
- facility location problem
- set cover
- open shop
- approximation schemes
- directed graph
- combinatorial auctions
- network design problem
- np hardness
- randomized algorithms
- input image
- probabilistic model