Approximation algorithm for the minimum partial connected Roman dominating set problem

DOI10.1007/s10878-024-01124-yMaRDI QIDQ6571270

Yaoyao Zhang, Zhao Zhang, Ding-Zhu Du

Publication date: 11 July 2024

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmpartial connected Roman dominating setquota Steiner tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

This page was built for publication: Approximation algorithm for the minimum partial connected Roman dominating set problem