An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem
Abstract
State-of-the-art branch-and-bound algorithms for the maximum clique problem (Maxclique) frequently use an upper bound based on a partition P of a graph into independent sets for a maximum clique of the graph, which cannot be very tight for imperfect graphs. In this paper we propose a new encoding from Maxclique into MaxSAT and use MaxSAT technology to improve the upper bound based on the partition P. In this way, the strength of specific algorithms for Maxclique in partitioning a graph and the strength of MaxSAT technology in propositional reasoning are naturally combined to solve Maxclique. Experimental results show that the approach is very effective on hard random graphs and on DIMACS Maxclique benchmarks, and allows to close an open DIMACS problem.
Cite
Text
Li and Quan. "An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem." AAAI Conference on Artificial Intelligence, 2010. doi:10.1609/AAAI.V24I1.7536Markdown
[Li and Quan. "An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem." AAAI Conference on Artificial Intelligence, 2010.](https://mlanthology.org/aaai/2010/li2010aaai-efficient/) doi:10.1609/AAAI.V24I1.7536BibTeX
@inproceedings{li2010aaai-efficient,
title = {{An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem}},
author = {Li, Chu Min and Quan, Zhe},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2010},
pages = {128-133},
doi = {10.1609/AAAI.V24I1.7536},
url = {https://mlanthology.org/aaai/2010/li2010aaai-efficient/}
}