Approximation algorithm for a generalized Roman domination problem in unit ball graphs
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-019-00459-1
Abstract: In this paper we propose a generalized Roman domination problem called connected strong k -Roman dominating set problem. It is NP-hard even in a unit ball graph. Unit ball graphs are the intersection graphs of… read more here.
Keywords: generalized roman; unit; ball graphs; unit ball ... See more keywords