An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem

@article{Fang2016AnEA,
  title={An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem},
  author={Zhiwen Fang and Chu Min Li and Ke Xu},
  journal={J. Artif. Intell. Res.},
  year={2016},
  volume={55},
  pages={799-833}
}
Recently, MaxSAT reasoning is shown very effective in computing a tight upper bound for a Maximum Clique (MC) of a (unweighted) graph. In this paper, we apply MaxSAT reasoning to compute a tight upper bound for a Maximum Weight Clique (MWC) of a wighted graph. We first study three usual encodings of MWC into weighted partial MaxSAT dealing with hard clauses, which must be satisfied in all solutions, and soft clauses, which are weighted and can be falsified. The drawbacks of these encodings… CONTINUE READING
9 Citations
68 References
Similar Papers

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…