Approximation Algorithms for Pick-and-Place Robots.
Anand SrivastavHartmut SchroeterChristoph MichelPublished in: Ann. Oper. Res. (2001)
Keyphrases
- approximation algorithms
- special case
- np hard
- mobile robot
- vertex cover
- worst case
- minimum cost
- multi robot
- facility location problem
- set cover
- network design problem
- approximation ratio
- approximation schemes
- primal dual
- exact algorithms
- np hardness
- randomized algorithms
- disjoint paths
- precedence constraints
- undirected graph
- constant factor
- integer programming
- open shop
- genetic algorithm
- combinatorial auctions
- polynomial time approximation
- optimization problems