Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs.
Andrzej CzygrinowMichal HanckowiakWojciech WawrzyniakMarcin WitkowskiPublished in: ISAAC (2018)
Keyphrases
- dominating set
- approximation algorithms
- facility location problem
- connected dominating set
- np hard
- special case
- minimum cost
- undirected graph
- vertex cover
- constant factor
- approximation ratio
- worst case
- randomized algorithms
- computer networks
- open shop
- polynomial time approximation
- primal dual
- approximation schemes
- set cover
- combinatorial auctions
- bipartite graph
- scheduling problem
- objective function
- directed graph