Distributed Approximation Algorithms in Unit-Disk Graphs.
Andrzej CzygrinowMichal HanckowiakPublished in: DISC (2006)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- vertex cover
- special case
- facility location problem
- worst case
- minimum cost
- approximation ratio
- approximation guarantees
- network design problem
- approximation schemes
- distributed systems
- randomized algorithms
- primal dual
- graph matching
- open shop
- np hardness
- constant factor
- disjoint paths
- directed graph
- set cover
- graph structure
- polynomial time approximation
- lower bound
- planar graphs
- tabu search
- simulated annealing
- genetic algorithm