Approximation algorithm for a generalized Roman domination problem in unit ball graphs

Limin Wang (), Yalin Shi (), Zhao Zhang (), Zan-Bo Zhang () and Xiaoyan Zhang ()
Additional contact information
Limin Wang: Nanjing University
Yalin Shi: Nanjing Normal University
Zhao Zhang: Zhejiang Normal University
Zan-Bo Zhang: Guangdong University of Finance & Economics
Xiaoyan Zhang: Nanjing Normal University

Journal of Combinatorial Optimization, 2020, vol. 39, issue 1, No 9, 138-148

Abstract: 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 equal sized balls in the three-dimensional space, they are widely used as a mathematical model for wireless sensor networks and some problems in computational geometry. This paper presents the first constant approximation algorithm with a guaranteed performance ratio at most $$6(k+2)$$6(k+2) in unit ball graphs, where k is a positive integer.

Keywords: Connected strong k-Roman dominating set; Constant approximation algorithm; Unit ball graph (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00459-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:39:y:2020:i:1:d:10.1007_s10878-019-00459-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00459-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().