Minimum-Cost b-Edge Dominating Sets on Trees
Sign Up to like & getrecommendations! Published in 2018 at "Algorithmica"
DOI: 10.1007/s00453-018-0448-z
Abstract: In this paper, we consider the minimum-cost b-edge dominating set problem. This is a generalization of the edge dominating set problem, but the computational complexity for trees is an astonishing open problem. We make steps… read more here.
Keywords: minimum cost; polynomial time; cost edge; edge dominating ... See more keywords