Approximation Algorithms for Barrier Sweep Coverage.
Barun GorainPartha Sarathi MandalPublished in: Int. J. Found. Comput. Sci. (2019)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- network design problem
- primal dual
- facility location problem
- approximation schemes
- open shop
- exact algorithms
- approximation ratio
- set cover
- constant factor
- precedence constraints
- np hardness
- disjoint paths
- constant factor approximation
- optimal solution
- multistage