A Dynamically Turbo-Charged Greedy Heuristic for Graph Coloring

12/29/2018
by   Faisal N. Abu-Khzam, et al.
0

We introduce a dynamic version of the graph coloring problem and prove its fixed-parameter tractability with respect to the edit-parameter. This is used to present a turbo-charged heuristic for the problem that works by combining the turbo-charging technique with other standard heuristic tools, including greedy coloring. The recently introduced turbo-charging idea is further enhanced in this paper by introducing a dynamic version of the so called moment of regret and rollback points. Experiments comparing our turbo-charging algorithm to other heuristics demonstrate its effectiveness. Our algorithm often produced results that were either exact or better than all the other available heuristics.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset