Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms.
Laurent BulteauGuillaume FertinIrena RusuPublished in: ISAAC (2009)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- special case
- vertex cover
- minimum cost
- facility location problem
- computational complexity
- primal dual
- exact algorithms
- set cover
- optimal solution
- np complete
- network design problem
- phase transition
- open shop
- approximation ratio
- randomized algorithms
- approximation schemes
- constant factor approximation
- information theoretic
- combinatorial auctions
- scheduling problem
- precedence constraints
- constraint satisfaction problems
- linear programming
- constant factor
- linear program
- disjoint paths