Finding a maximum clique in an arbitrary graph
SIAM Journal on Computing
New upper bounds for maximum satisfiability
Journal of Algorithms
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
Combinatorial Approaches to Finding Subtle Signals in DNA Sequences
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Solving weighted CSP by maintaining arc consistency
Artificial Intelligence
Optimal Protein Structure Alignment Using Maximum Cliques
Operations Research
A new trust region technique for the maximum weight clique problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Artificial Intelligence
A logical approach to efficient Max-SAT solving
Artificial Intelligence
Study of lower bound functions for MAX-2-SAT
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
New inference rules for efficient Max-SAT solving
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Dynamic local search for the maximum clique problem
Journal of Artificial Intelligence Research
New inference rules for Max-SAT
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Existential arc consistency: getting closer to full arc consistency in weighted CSPs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A simple model to generate hard satisfiable instances
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
MiniMaxSAT: a new weighted Max-SAT solver
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
An efficient branch-and-bound algorithm for finding a maximum clique
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Improved exact solvers for weighted Max-SAT
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
An algorithm for finding a maximum clique in a graph
Operations Research Letters
Read-once resolution for unsatisfiability-based Max-SAT algorithms
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
| Hi-index | 0.01 |
In this paper we propose the use of two resolution-based rules for the Max-SAT encoding of the Maximum Clique Problem. These rules simplify the problem instance in such a way that a lower bound of the optimum becomes explicit. Then, we present a pre-processing procedure that applies such rules. Empirical results show evidence that the lower bound obtained with the pre-processing outperforms previous approaches. Finally, we show that a branch-and-bound Max-SAT solver fed with the simplified problem can be boosted several orders of magnitude.