Obtaining the Grundy chromatic number : how bad can my greedy heuristic coloring be?
Year of publication: |
2024
|
---|---|
Authors: | Silva, Mateus C. ; Melo, Rafael A. ; Resende, Mauricio G. C. ; Santos, Marcio C. ; Toso, Rodrigo F. |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 168.2024, Art.-No. 106703, p. 1-17
|
Subject: | Combinatorial optimization | Graph coloring | Greedy heuristic | Grundy number | Worst-case analysis |
-
A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM
SINGH, ALOK, (2006)
-
Optimal Sequencing and Resource Allocation in Research and Development Projects
Granot, Daniel, (1991)
-
An application of the greedy heuristic of set cover to traffic checks
Pusztai, Pál, (2008)
- More ...
-
Andrade, Carlos E., (2021)
-
Biased random-key genetic algorithms with applications in telecommunications
Resende, Mauricio G. C., (2012)
-
P.G. Petroianu, Larissa, (2020)
- More ...