Algorithms for the global domination problem
Year of publication: |
2025
|
---|---|
Authors: | Parra Inza, Ernesto ; Vakhania, Nodari ; Sigarreta Almira, José María ; Hernández Mira, Frank Ángel |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 173.2025, Art.-No. 106876, p. 1-14
|
Subject: | Graph theory | Global dominating set | Heuristic | Computational complexity | Graphentheorie | Heuristik | Heuristics | Algorithmus | Algorithm | Globalisierung | Globalization |
-
Incremental network design with shortest paths
Baxter, Matthew, (2014)
-
Exact and heuristic algorithms for the domination problem
Parra Inza, Ernesto, (2024)
-
A new formulation for the Safe Set problem on graphs
Macambira, Ana Flavia Uzeda, (2019)
- More ...
-
Exact and heuristic algorithms for the domination problem
Parra Inza, Ernesto, (2024)
-
Preemptive scheduling of equal-length jobs to maximize weighted throughput
Baptiste, Philippe, (2004)
-
An optimal rounding gives a better approximation for scheduling unrelated machines
Shchepin, Evgeny V., (2005)
- More ...