1 paper
Dunja Pucher, Franz Rendl
The stable set problem and the graph coloring problem are classes of NP-hard optimization problems on graphs. It is well known that even near-optimal solutions for these problems a…