Approximation Algorithms for the Single Robot Line Coverage Problem.
Saurav AgarwalSrinivas AkellaPublished in: WAFR (2021)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- facility location problem
- mobile robot
- vertex cover
- primal dual
- network design problem
- minimum cost
- approximation ratio
- precedence constraints
- randomized algorithms
- set cover
- exact algorithms
- human robot interaction
- approximation schemes
- np hardness
- constant factor
- undirected graph
- multistage
- open shop
- constant factor approximation