Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
