The edge clique covering problem consists in covering the edges of a graph using the minimum number of cliques. The problem is NP-hard and even state-of-the-art heuristic methods may have prohibitive runtime or obtain low quality solutions. This paper proposes fast and better constructive and improvement heuristics for the problem. Computational experiments show the proposed heuristics can find better solutions in few seconds for most instances. Tests were run on edge clique covering, DIMACS and BHOSLIB instances.

中文翻译：

---

快速建设性和改进的启发式方法，用于边缘团覆盖

边缘团覆盖问题在于使用最少数量的团来覆盖图形的边缘。问题在于NP难，甚至最先进的启发式方法也可能运行时间过长或获得低质量的解决方案。本文提出了针对该问题的快速，更好的构造和改进启发式方法。计算实验表明，对于大多数情况，所提出的启发式方法可以在几秒钟内找到更好的解决方案。测试在边缘集团覆盖物，DIMACS和BHOSLIB实例上进行。