Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness.
Wojciech NadaraMarcin PilipczukRoman RabinovichFelix ReidlSebastian SiebertzPublished in: ACM J. Exp. Algorithmics (2019)
Keyphrases
- empirical evaluation
- approximation algorithms
- graph coloring
- np hard
- combinatorial problems
- phase transition
- job shop scheduling
- special case
- constraint satisfaction problems
- worst case
- scheduling problem
- max sat
- hyper heuristics
- constant factor
- vertex cover
- constraint programming
- approximation ratio
- randomized algorithms
- genetic programming
- artificial bee colony
- bin packing
- simulated annealing
- optimal solution
- constant factor approximation