Improved approximation algorithms for computing k disjoint paths subject to two constraints.
Longkun GuoHong ShenKewen LiaoPublished in: J. Comb. Optim. (2015)
Keyphrases
- disjoint paths
- approximation algorithms
- np hard
- special case
- precedence constraints
- minimum cost
- facility location problem
- worst case
- network design problem
- approximation ratio
- vertex cover
- undirected graph
- primal dual
- constant factor
- directed graph
- np hardness
- polynomial time approximation
- network flow
- approximation guarantees
- optimal solution