Approximation Algorithms for Minimizing Maximum Sensor Movement for Line Barrier Coverage in the Plane.
Longkun GuoHong ShenPublished in: CoRR (2017)
Keyphrases
- approximation algorithms
- np hard
- mobile sensor networks
- worst case
- special case
- vertex cover
- facility location problem
- network design problem
- line segments
- exact algorithms
- minimum cost
- vanishing points
- integrality gap
- sensor networks
- np hardness
- precedence constraints
- set cover
- randomized algorithms
- primal dual
- constant factor
- approximation schemes
- open shop
- upper bound
- linear program
- disjoint paths
- approximation ratio
- undirected graph