Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length.
Victor ChepoiBertrand EstellonYann VaxèsPublished in: Theor. Comput. Sci. (2008)
Keyphrases
- disjoint paths
- approximation algorithms
- np hard
- special case
- vertex cover
- facility location problem
- longest common subsequence
- approximation ratio
- worst case
- network design problem
- minimum cost
- open shop
- randomized algorithms
- set cover
- approximation schemes
- primal dual
- approximation guarantees
- undirected graph
- combinatorial auctions
- constant factor
- reinforcement learning
- np hardness
- precedence constraints
- constant factor approximation