Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness.
Wojciech NadaraMarcin PilipczukRoman RabinovichFelix ReidlSebastian SiebertzPublished in: CoRR (2018)
Keyphrases
- empirical evaluation
- approximation algorithms
- graph coloring
- np hard
- combinatorial problems
- job shop scheduling
- special case
- constraint satisfaction problems
- phase transition
- vertex cover
- scheduling problem
- worst case
- max sat
- approximation ratio
- hyper heuristics
- randomized algorithms
- branch and bound algorithm
- constant factor approximation
- constraint satisfaction
- constraint programming
- lower bound
- metaheuristic
- combinatorial optimization
- bin packing
- evolutionary computation
- orders of magnitude
- np complete
- evolutionary algorithm
- search algorithm