Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length.
Victor ChepoiBertrand EstellonYann VaxèsPublished in: WADS (2005)
Keyphrases
- disjoint paths
- approximation algorithms
- np hard
- special case
- longest common subsequence
- facility location problem
- vertex cover
- minimum cost
- undirected graph
- approximation ratio
- set cover
- worst case
- network design problem
- precedence constraints
- approximation schemes
- open shop
- randomized algorithms
- constant factor
- primal dual
- dynamic programming
- error bounds