Dense Steiner problems: Approximation algorithms and inapproximability.
Marek KarpinskiMateusz LewandowskiSyed Mohammad MeesumMatthias MnichPublished in: CoRR (2020)
Keyphrases
- approximation algorithms
- vertex cover
- approximation schemes
- exact algorithms
- np hard
- np hardness
- randomized algorithms
- special case
- network design problem
- minimum cost
- worst case
- quadratic program
- open shop
- facility location problem
- precedence constraints
- primal dual
- set cover
- constant factor approximation
- lower bound
- combinatorial auctions
- simulated annealing