Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs.
Peyman AfshaniTimothy M. ChanPublished in: CCCG (2005)
Keyphrases
- approximation algorithms
- undirected graph
- special case
- np hard
- vertex cover
- maximum clique
- weighted graph
- maximal cliques
- worst case
- graph structure
- minimum cost
- facility location problem
- set cover
- np hardness
- network design problem
- approximation guarantees
- randomized algorithms
- graph theory
- approximation ratio
- primal dual
- disjoint paths
- constant factor
- graph matching
- open shop
- precedence constraints
- approximation schemes
- integrality gap
- graph theoretic