On greedy approximation algorithm for the minimum resolving dominating set problem

Hao Zhong ()
Additional contact information
Hao Zhong: South China Normal University

Journal of Combinatorial Optimization, 2024, vol. 48, issue 4, No 8, 8 pages

Abstract: Abstract In this paper, we investigate the minimum resolving dominating set problem which is a emerging combinatorial optimization problem in general graphs. We prove that the resolving dominating set problem is NP-hard and propose a greedy algorithm with an approximation ratio of ( $$1 + 2\ln n$$ 1 + 2 ln n ) by establishing a submodular potential function, where n is the node number of the input graph.

Keywords: Resolving dominating set; NP-hard; Submodular function; Greedy approximation algorithm; 68Q87 (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-01229-4 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:48:y:2024:i:4:d:10.1007_s10878-024-01229-4

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

DOI: 10.1007/s10878-024-01229-4

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