Approximation algorithm for the minimum partial connected Roman dominating set problem

Yaoyao Zhang, Zhao Zhang () and Ding-Zhu Du ()
Additional contact information
Yaoyao Zhang: Xinjiang University
Zhao Zhang: Zhejiang Normal University
Ding-Zhu Du: University of Texas at Dallas

Journal of Combinatorial Optimization, 2024, vol. 47, issue 4, No 9, 10 pages

Abstract: Abstract Given a graph $$G=(V,E)$$ G = ( V , E ) and a function $$r:V\mapsto \{0,1,2\}$$ r : V ↦ { 0 , 1 , 2 } , a node $$v\in V$$ v ∈ V is said to be Roman dominated if $$r(v)=1$$ r ( v ) = 1 or there exists a node $$u\in N_G[v]$$ u ∈ N G [ v ] such that $$r(u)=2$$ r ( u ) = 2 , where $$ N_G[v]$$ N G [ v ] is the closed neighbor set of v in G. For $$i\in \{0,1,2\}$$ i ∈ { 0 , 1 , 2 } , denote $$V_r^i$$ V r i as the set of nodes with value i under function r. The cost of r is defined to be $$c(r)=|V_r^1|+2|V_r^2|$$ c ( r ) = | V r 1 | + 2 | V r 2 | . Given a positive integer $$Q\le |V|$$ Q ≤ | V | , the minimum partial connected Roman dominating set (MinPCRDS) problem is to compute a minimum cost function r such that at least Q nodes in G are Roman dominated and the subgraph of G induced by $$V_r^1\cup V_r^2$$ V r 1 ∪ V r 2 is connected. In this paper, we give a $$(3\ln |V|+9)$$ ( 3 ln | V | + 9 ) -approximation algorithm for the MinPCRDS problem.

Keywords: Partial connected Roman dominating set; Approximation algorithm; Quota Steiner tree (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-024-01124-y 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:47:y:2024:i:4:d:10.1007_s10878-024-01124-y

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

DOI: 10.1007/s10878-024-01124-y

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 ().