Region-based Approximation Algorithms for Visibility between Imprecise Locations.
Kevin BuchinIrina KostitsynaMaarten LöfflerRodrigo I. SilveiraPublished in: ALENEX (2015)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- facility location problem
- vertex cover
- np hardness
- network design problem
- approximation ratio
- image segmentation
- approximation schemes
- open shop
- primal dual
- set cover
- constant factor
- exact algorithms
- undirected graph
- randomized algorithms
- disjoint paths
- precedence constraints
- scheduling problem