Approximation Algorithms for Distributed Multi-Robot Coverage in Non-Convex Environments.
Armin SadeghiAhmad Bilal AsgharStephen L. SmithPublished in: CoRR (2020)
Keyphrases
- approximation algorithms
- np hard
- special case
- quadratic program
- vertex cover
- minimum cost
- worst case
- distributed systems
- facility location problem
- network design problem
- disjoint paths
- set cover
- open shop
- exact algorithms
- heterogeneous environments
- convex hull
- approximation schemes
- randomized algorithms
- np hardness
- constant factor approximation
- lower bound
- constant factor
- approximation ratio
- precedence constraints
- primal dual
- convex optimization
- branch and bound algorithm
- directed graph
- theoretical analysis
- scheduling problem