Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem.
Ulrich FößmeierMichael KaufmannAlexander ZelikovskyPublished in: Discret. Comput. Geom. (1997)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- facility location problem
- vertex cover
- minimum cost
- open shop
- prize collecting
- approximation schemes
- exact algorithms
- primal dual
- network design problem
- set cover
- randomized algorithms
- approximation ratio
- constant factor
- approximation guarantees
- undirected graph
- combinatorial auctions
- linear program