On approximation algorithms of k-connected m-dominating sets in disk graphs.
My T. ThaiNing ZhangRavi TiwariXiaochun XuPublished in: Theor. Comput. Sci. (2007)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- vertex cover
- facility location problem
- approximation guarantees
- network design problem
- worst case
- approximation ratio
- minimum cost
- set cover
- primal dual
- open shop
- randomized algorithms
- connected graphs
- disjoint paths
- np hardness
- constant factor
- graph matching
- approximation schemes
- graph structure
- objective function
- precedence constraints
- weighted graph