Dominating Set Approximation is an approximation algorithm that belongs to the class of graph optimization methods, specifically designed to compute a near-optimal subset of vertices in a graph such that every vertex is either in the subset or adjacent to at least one vertex in it, with performance guarantees relative to the minimum dominating set.
465
Publications
24.5K
Citations
854
Authors
427
Institutions
Publications per year
2017–2026
69
Parents
Publications
465
Approximation Algorithms for Connected Dominating Sets
Suvajyoti Guha, Samir Khuller · Algorithmica · 1998 · 1.1K citations
Towards a theory of domination in graphs
E. J. Cockayne, Stephen T. Hedetniemi · Networks · 1977 · 635 citations
1–5 of 465
Authors
854
- WW
19
h-index
- MA
16
h-index
- PW
14
h-index
- DD
14
h-index
- XG
11
h-index
1–5 of 854
Institutions
427
The University of Texas at Dallas
Richardson, United States
25 h-index
72 publications
3.7K citations
ETH Zurich
Zurich, Switzerland
14 h-index
25 publications
1.5K citations
Illinois Institute of Technology
Chicago, United States
14 h-index
31 publications
5.8K citations
Xinjiang University
Ürümqi, China
13 h-index
19 publications
749 citations
Centre National de la Recherche Scientifique
Paris, France
12 h-index
20 publications
668 citations
University of Bergen
Bergen, Norway
12 h-index
24 publications
886 citations
Xi'an Jiaotong University
Xi'an, China
12 h-index
27 publications
732 citations
University of Johannesburg
Johannesburg, South Africa
11 h-index
16 publications
685 citations
1–8 of 427
Venues
- Discrete Applied Mathematics
45 publications · 1.8K citations
26
h-index
- Theoretical Computer Science
30 publications · 1.8K citations
21
h-index
- Discrete Mathematics
30 publications · 1.3K citations
18
h-index
- Information Processing Letters
24 publications · 955 citations
15
h-index
- Journal of Combinatorial Optimization
18 publications · 568 citations
13
h-index
1–5