Approximation Algorithms for Distributed Multi-robot Coverage in Non-convex Environments.
Armin SadeghiAhmad Bilal AsgharStephen L. SmithPublished in: WAFR (2021)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- distributed systems
- facility location problem
- heterogeneous environments
- network design problem
- approximation schemes
- minimum cost
- quadratic program
- set cover
- approximation ratio
- exact algorithms
- randomized algorithms
- precedence constraints
- np hardness
- convex optimization
- disjoint paths
- constant factor
- primal dual
- open shop
- polynomial time approximation
- scheduling problem