Dominating Set Location Problem
The Dominating Set Location Problem is a combinatorial optimization model in facility location theory that identifies a minimal set of facility sites such that every demand point is either directly served by a facility or located within a specified coverage threshold of at least one facility, ensuring dominance over the entire network.
29
Publications
1.8K
Citations
70
Authors
50
Institutions
Publications per year
2017–2026
6
Parents
29
Domination and location in acyclic graphs
Peter J. Slater · Networks · 1987 · 206 citations
Dominating Biological Networks
Tijana Milenković, Vesna Memišević, Anthony Bonato et al. · PLoS ONE · 2011 · 114 citations · Full text
1–5 of 29
70
4
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 70
50

Centre National de la Recherche Scientifique
Paris, France
5 h-index
11 publications
402 citations
Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes
Aubière, France
5 h-index
5 publications
152 citations

Université Clermont Auvergne
Clermont-Ferrand, France
4 h-index
4 publications
134 citations
University of Alabama in Huntsville
Huntsville, United States
3 h-index
3 publications
280 citations

University of Turku
Turku, Finland
2 h-index
3 publications
97 citations
National University of Rosario
Rosario, Argentina
2 h-index
5 publications
76 citations
Université Claude Bernard Lyon 1
Villeurbanne, France
2 h-index
2 publications
81 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
2 publications
129 citations
1–8 of 50
5 publications · 147 citations
5
h-index
3 publications · 304 citations
3
h-index
2 publications · 91 citations
2
h-index
1 publications · 559 citations
1
h-index
TOMACS · 1 publications · 30 citations
1
h-index
1–5