Constant-approximation algorithms for highly connected multi-dominating sets in unit disk graphs.
Takuro FukunagaPublished in: CoRR (2015)
Keyphrases
- approximation algorithms
- highly connected
- constant factor
- special case
- np hard
- vertex cover
- minimum cost
- undirected graph
- open shop
- primal dual
- worst case
- approximation ratio
- facility location problem
- approximation schemes
- precedence constraints
- set cover
- approximation guarantees
- objective function
- computational complexity