Approximation Algorithms for Steiner and Directed Multicuts.
Philip N. KleinSerge A. PlotkinSatish RaoÉva TardosPublished in: J. Algorithms (1997)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- minimum cost
- facility location problem
- network design problem
- open shop
- approximation ratio
- approximation schemes
- set cover
- worst case
- np hardness
- randomized algorithms
- precedence constraints
- primal dual
- undirected graph
- disjoint paths
- combinatorial auctions
- upper bound
- computational complexity
- search algorithm