A Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems.

Frank Hoffmann Klaus Kriegel

Published in: SIAM J. Discret. Math. (1996)

Keyphrases

graph coloring
combinatorial problems
np complete problems
art gallery
job shop scheduling
examination timetabling
constraint programming
hyper heuristics
optimization problems
np complete
benchmark problems
heuristic methods
max sat
computational geometry