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 Jg. 48; H. 4; S. 35
1. Verfasser:	Zhong, Hao
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.11.2024 Springer Nature B.V
Schlagworte:	Algorithms Approximation Combinatorial analysis Combinatorics Convex and Discrete Geometry Greedy algorithms Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Optimization techniques Theory of Computation Submodular function NP-hard Greedy approximation algorithm 68Q87 Resolving dominating set
ISSN:	1382-6905, 1573-2886
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!