Approximation Algorithms for Highly Connected Multi-dominating Sets in Unit Disk Graphs.
Takuro FukunagaPublished in: Algorithmica (2018)
Keyphrases
- approximation algorithms
- highly connected
- np hard
- special case
- worst case
- undirected graph
- vertex cover
- minimum cost
- set cover
- facility location problem
- primal dual
- randomized algorithms
- constant factor approximation
- approximation schemes
- constant factor
- approximation ratio
- open shop
- polynomial time approximation
- disjoint paths
- approximation guarantees
- precedence constraints
- combinatorial auctions
- optimal solution