Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs.
Andrzej CzygrinowMichal HanckowiakEdyta SzymanskaWojciech WawrzyniakMarcin WitkowskiPublished in: Theor. Comput. Sci. (2017)
Keyphrases
- dominating set
- computational complexity
- np hard
- planar graphs
- connected dominating set
- dynamic programming
- worst case
- optimal solution
- facility location problem
- lower and upper bounds
- parameter estimation
- simulated annealing
- objective function
- energy function
- em algorithm
- maximum likelihood
- probability distribution