Login / Signup
Distributed Approximation Algorithms for k-dominating Set in Graphs of Bounded Genus and Linklessly Embeddable Graphs.
Andrzej Czygrinow
Michal Hanckowiak
Wojciech Wawrzyniak
Marcin Witkowski
Published in:
ICTCS/CILC (2017)
Keyphrases
</>
approximation algorithms
dominating set
facility location problem
connected dominating set
undirected graph
special case
vertex cover
np hard
weighted graph
directed graph
randomized algorithms
search algorithm
evolutionary algorithm
dynamic systems
minimum cost
planar graphs