Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP)

Abstract In this paper the performance of the Hamming-based Reactive Tabu Search algorithm (H-RTS) previously proposed for the Maximum Satisfiability problem is studied for the different Maximum k-Conjunctive Constraint Satisfaction problem. In addition, the use of non-oblivious functions recently proposed in the framework of approximation algorithms is investigated. In particular, two relevant special cases of the Maximum k-Conjunctive Constraint Satisfaction problem are considered: Maximum Directed Cut and Maximum Independent Set in cubic graphs. The preliminary diversification-bias analysis of the basic components shows a remarkable difference between the two problems, and the derived predictions are then validated by extensive experiments with the complete H-RTS algorithm. The performance of H-RTS is compared with that of Simulated Annealing and simple Repeated Local Search.

[1]  Roberto Battiti,et al.  Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.

[2]  Roberto Battiti,et al.  Reactive search, a history-sensitive heuristic for MAX-SAT , 1997, JEAL.

[3]  David P. Williamsony.  A New 3 4 -approximation Algorithm for Max Sat , 1994 .

[4]  Uri Zwick,et al.  A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[5]  Uriel Feige,et al.  Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[6]  Luca Trevisan.  Approximating Satisfiable Satisfiability Problems (Extended Abstract) , 1997, ESA.

[7]  Mihalis Yannakakis,et al.  On the approximation of maximum satisfiability , 1992, SODA '92.

[8]  Giorgio Ausiello,et al.  Theoretical Computer Science Approximate Solution of Np Optimization Problems * , 2022 .

[9]  Roberto Battiti,et al.  Solving MAX-SAT with non-oblivious functions and history-based heuristics , 1996, Satisfiability Problem: Theory and Applications.

[10]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[11]  Rajeev Motwani,et al.  On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[12]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[13]  共立出版株式会社.  コンピュータ・サイエンス : ACM computing surveys , 1978 .

[14]  Afonso Ferreira,et al.  BOUNDING THE PROBABILITY OF SUCCESS OF STOCHASTIC METHODS FOR GLOBAL OPTIMIZATION , 1993 .

[15]  Paola Alimonti.  Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems , 1995, WG.

[16]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[17]  Satissed Now Consider.  Improved Approximation Algorithms for Maximum Cut and Satissability Problems Using Semideenite Programming , 1997 .

[18]  Lars Engebretsen,et al.  Clique Is Hard To Approximate Within , 2000 .

[19]  Viggo Kann,et al.  Hardness of Approximating Problems on Cubic Graphs , 1997, CIAC.

[20]  Takao Asano,et al.  Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[21]  Rossella Petreschi,et al.  Cubic graphs , 1995, CSUR.

[22]  Paola Alimonti.  New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems , 1994, CIAC.

[23]  Luca Trevisan,et al.  Positive Linear Programming, Parallel Approximation and PCP's , 1996, ESA.

[24]  David P. Williamson,et al.  New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem , 1994, SIAM J. Discret. Math..

[25]  Luca Trevisan.  Approximating Satisfiable Satisfiability Problems , 2000, Algorithmica.

[26]  Roberto Battiti,et al.  Reactive Search, a history-based heuristic for MAX-SAT , 1996 .

[27]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

[28]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[29]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[30]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[31]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[32]  Roberto Battiti,et al.  Reactive Local Search for Maximum Clique , 1997 .

[33]  Jun Gu,et al.  Algorithms for the satisfiability (SAT) problem: A survey , 1996, Satisfiability Problem: Theory and Applications.

[34]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[35]  Giorgio Ausiello,et al.  Local Search, Reducibility and Approximability of NP-Optimization Problems , 1995, Inf. Process. Lett..