Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm
Sign Up to like & getrecommendations! Published in 2019 at "Algorithmica"
DOI: 10.1007/s00453-019-00545-0
Abstract: In this paper we consider the classical connected dominating set problem. Twenty years ago, Guha and Khuller developed two algorithms for this problem—a centralized greedy approach with an approximation guarantee of $$H(\varDelta ) +2$$H(Δ)+2, and… read more here.
Keywords: information greedy; information; local information; algorithm ... See more keywords