Linear-Time Approximation Algorithms for Unit Disk Graphs.
Guilherme Dias da FonsecaVinícius Gusmão Pereira de SáCelina M. H. de FigueiredoPublished in: CoRR (2014)
Keyphrases
- approximation algorithms
- worst case
- undirected graph
- np hard
- special case
- minimum cost
- vertex cover
- network design problem
- approximation guarantees
- set cover
- approximation ratio
- facility location problem
- upper bound
- directed graph
- open shop
- randomized algorithms
- constant factor approximation
- lower bound
- precedence constraints
- constant factor
- np hardness
- approximation schemes
- primal dual
- error bounds
- planar graphs
- polynomial time approximation
- disjoint paths
- scheduling problem