Lower Bounds for Approximation Algorithms for the Steiner Tree Problem.
Clemens GröplStefan HougardyTill NierhoffHans Jürgen PrömelPublished in: WG (2001)
Keyphrases
- approximation algorithms
- lower bound
- np hard
- worst case
- upper bound
- branch and bound algorithm
- minimum cost
- branch and bound
- randomized algorithms
- special case
- constant factor
- vertex cover
- optimal solution
- linear programming
- scheduling problem
- network design problem
- np hardness
- lower and upper bounds
- integer programming
- approximation schemes
- objective function
- integrality gap
- primal dual
- open shop
- set cover
- approximation ratio
- linear programming relaxation
- combinatorial auctions
- randomly generated problems
- approximation guarantees
- polynomial time approximation
- computational complexity
- disjoint paths
- constraint satisfaction problems
- sample size
- strongly np hard
- linear program
- feasible solution
- online algorithms
- undirected graph
- cutting plane
- exact algorithms