On greedy approximation algorithm for the minimum resolving dominating set problem

On greedy approximation algorithm for the minimum resolving dominating set problem

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 ) by establish...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of combinatorial optimization 2024-11, Vol.48 (4), Article 35
1. Verfasser: Zhong, Hao
Format: Artikel
Sprache:eng
Schlagworte:
Approximation
Combinatorial analysis
Combinatorics
Convex and Discrete Geometry
Greedy algorithms
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Theory of Computation
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 ) by establishing a submodular potential function, where n is the node number of the input graph.
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-024-01229-4