Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem.
Annie ChateauRodolphe GiroudeauPublished in: AlCoB (2014)
Keyphrases
- approximation algorithms
- worst case
- np hardness
- np hard
- special case
- vertex cover
- minimum cost
- approximation ratio
- exact algorithms
- facility location problem
- constant factor
- open shop
- primal dual
- computational complexity
- set cover
- randomized algorithms
- network design problem
- approximation schemes
- linear programming
- constant factor approximation
- combinatorial auctions
- undirected graph
- greedy algorithm
- error bounds