Analysis of an iterated greedy heuristic for vertex clique covering
(2018)
Journal Article
Chalupa, D., & Pospíchal, J. (2018). Analysis of an iterated greedy heuristic for vertex clique covering. Computing and Informatics, 37(2), 385-404. https://doi.org/10.4149/cai_2018_2_385
The aim of the vertex clique covering problem (CCP) is to cover the vertices of a graph with as few cliques as possible. We analyse the iterated greedy (IG) algorithm for CCP, which was previously shown to provide strong empirical results for real-wo... Read More about Analysis of an iterated greedy heuristic for vertex clique covering.