The approximability of non-Boolean satisfiability problems and restricted integer programming

  • Authors:

  • Maria Serna;Luca Trevisan;Fatos Xhafa

  • Affiliations:

  • Department of LSI, UPC, Jordi Girona Salgado, Barcelona, Spain;University of California at Berkeley Computer Science Division, Berkeley, CA;Department of LSI, UPC, Jordi Girona Salgado, Barcelona, Spain

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2005

Quantified Score

Hi-index 5.23

Visualization

Abstract

In this paper we present improved approximation algorithms for two classes of maximization problems defined in Barland et al. (J. Comput. System Sci. 57(2) (1998) 144). Our factors of approximation substantially improve the previous known results and are close to the best possible. On the other hand, we show that the approximation results in the framework of Barland et al. hold also in the parallel setting, and thus we have a new common framework for both computational settings. We prove almost tight non-approximability results, thus solving a main open question of Barland et al.We obtain the results through the constraint satisfaction problem over multi-valued domains, for which we develop approximation algorithms and show non-approximability results. Our parallel approximation algorithms are based on linear programming and random rounding; they are better than previously known sequential algorithms. The non-approximability results are based on new recent progress in the fields of probabilistically checkable proofs and multi-prover one-round proof systems.