Skip to main content
SpringerLink
Log in

Differential Approximation of min sat, max sat and Related Problems

  • Conference paper
Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3483))

Included in the following conference series:

Abstract

We present differential approximation results (both positive and negative) for optimal satisfiability, optimal constraint satisfaction, and some of the most popular restrictive versions of them. As an important corollary, we exhibit an interesting structural difference between the landscapes of approximability classes in standard and differential paradigms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and approximation. Combinatorial optimization problems and their approximability properties. Springer, Berlin (1999)

    MATH  Google Scholar 

  2. Vazirani, V.: Approximation algorithms. Springer, Berlin (2001)

    Google Scholar 

  3. Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation and complexity classes. J. Comput. System Sci. 43, 425–440 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  4. Crescenzi, P., Kann, V., Silvestri, R., Trevisan, L.: Structure in approximation classes. SIAM J. Comput. 28, 1759–1782 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hooker, J.N.: Resolution vs. cutting plane solution of inference problems: some computational experience. Oper. Res. Lett. 7, 1–7 (1988)

    MATH  MathSciNet  Google Scholar 

  6. Kamath, A.P., Karmarkar, N.K., Ramakrishnan, K.G., Resende, M.G.: Computational experience with an interior point algorithm on the satisfiability problem. Ann. Oper. Res. 25, 43–58 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  7. Bazgan, C., Paschos, V.T.: Differential approximation for optimal satisfiability and related problems. European J. Oper. Res. 147, 397–404 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Monnot, J., Paschos, V.T., Toulouse, S.: Approximation polynomiale des problèmes NP-difficiles: optima locaux et rapport différentiel. Hermès, Paris (2003)

    MATH  Google Scholar 

  9. Escoffier, B., Paschos, V.T.: Differential approximation of MIN SAT, MAX SAT and related problems. In: Cahier du LAMSADE 220, LAMSADE, Université Paris-Dauphine (2004)

    Google Scholar 

  10. Håstad, J.: Some optimal inapproximability results. J. Assoc. Comput. Mach. 48, 798–859 (2001)

    MATH  Google Scholar 

  11. Bertsimas, D., Teo, C.P., Vohra, R.: On dependent randomized rounding algorithms. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 330–344. Springer, Heidelberg (1996)

    Google Scholar 

  12. Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LAMSADE, Université Paris-Dauphine and CNRS UMR, 7024 Place du Maréchal De Lattre de Tassigny, 75775, Paris Cedex 16, France

    Bruno Escoffier & Vangelis Th. Paschos

Authors
  1. Bruno Escoffier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vangelis Th. Paschos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Escoffier, B., Paschos, V.T. (2005). Differential Approximation of min sat, max sat and Related Problems. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424925_22

Download citation

  • DOI: https://doi.org/10.1007/11424925_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25863-6

  • Online ISBN: 978-3-540-32309-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation