Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees.
Thomas ErlebachKlaus JansenPublished in: WAE (2000)
Keyphrases
- disjoint paths
- approximation algorithms
- undirected graph
- special case
- np hard
- worst case
- network design problem
- minimum cost
- directed graph
- set cover
- vertex cover
- open shop
- facility location problem
- primal dual
- edge weights
- precedence constraints
- constant factor
- weighted sum
- scheduling problem
- approximation ratio
- approximation schemes
- lower bound