Approximation algorithms for lawn mowing and milling.
Esther M. ArkinSándor P. FeketeJoseph S. B. MitchellPublished in: Comput. Geom. (2000)
Keyphrases
- approximation algorithms
- np hard
- soft computing
- special case
- high speed
- facility location problem
- vertex cover
- worst case
- minimum cost
- set cover
- tool wear
- np hardness
- network design problem
- open shop
- approximation ratio
- disjoint paths
- exact algorithms
- genetic algorithm
- primal dual
- randomized algorithms
- undirected graph
- approximation schemes
- precedence constraints
- greedy algorithm
- lower bound
- objective function