Maximal strip recovery problem with gaps: Hardness and approximation algorithms.
Laurent BulteauGuillaume FertinIrena RusuPublished in: J. Discrete Algorithms (2013)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- special case
- minimum cost
- vertex cover
- facility location problem
- np complete
- set cover
- approximation ratio
- lower bound
- open shop
- primal dual
- approximation schemes
- scheduling problem
- constant factor
- computational complexity
- precedence constraints
- network design problem
- randomized algorithms
- disjoint paths
- phase transition
- information theoretic
- polynomial time approximation
- linear programming
- upper bound
- constraint satisfaction problems
- branch and bound algorithm
- greedy heuristic
- exact algorithms
- combinatorial auctions
- error bounds