Approximation Algorithms for Covering and Packing Problems on Paths.
Arindam PalPublished in: CoRR (2014)
Keyphrases
- approximation algorithms
- packing problem
- disjoint paths
- np hard
- integer programming
- bin packing
- special case
- worst case
- vertex cover
- facility location problem
- network design problem
- approximation ratio
- set cover
- minimum cost
- open shop
- primal dual
- np hardness
- approximation schemes
- shortest path
- constant factor approximation
- undirected graph
- constant factor
- cutting stock
- computational complexity
- combinatorial auctions
- scheduling problem