Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem.
Ulrich FößmeierMichael KaufmannAlexander ZelikovskyPublished in: ISAAC (1993)
Keyphrases
- approximation algorithms
- special case
- np hard
- vertex cover
- worst case
- facility location problem
- network design problem
- minimum cost
- set cover
- exact algorithms
- approximation schemes
- primal dual
- np hardness
- approximation ratio
- prize collecting
- precedence constraints
- undirected graph
- open shop
- error bounds
- constant factor approximation
- computational complexity
- randomized algorithms
- constant factor
- lower bound