Approximation Algorithms for Barrier Sweep Coverage.
Barun GorainPartha Sarathi MandalPublished in: CoRR (2017)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- vertex cover
- set cover
- minimum cost
- network design problem
- approximation schemes
- primal dual
- facility location problem
- constant factor
- approximation ratio
- open shop
- exact algorithms
- disjoint paths
- precedence constraints
- np hardness
- undirected graph
- lower bound
- randomized algorithms
- strongly np hard