Approximation Algorithms for the Set Cover Formation by Oblivious Mobile Robots.
Tomoko IzumiSayaka KameiYukiko YamauchiPublished in: OPODIS (2014)
Keyphrases
- set cover
- approximation algorithms
- mobile robot
- np hard
- greedy heuristics
- special case
- path planning
- vertex cover
- worst case
- minimum cost
- multi robot
- constant factor
- open shop
- primal dual
- approximation schemes
- precedence constraints
- approximation ratio
- disjoint paths
- randomized algorithms
- undirected graph
- constant factor approximation
- genetic algorithm
- combinatorial auctions
- greedy algorithm
- computational complexity