• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

Differential approximation of MIN SAT, MAX SAT and related problems

Paschos, Vangelis; Escoffier, Bruno (2007), Differential approximation of MIN SAT, MAX SAT and related problems, European Journal of Operational Research, 181, 2, p. 620-633. http://dx.doi.org/10.1016/j.ejor.2005.04.057

View/Open
cahier220.pdf (391.5Kb)
Type
Article accepté pour publication ou publié
Date
2007
Journal name
European Journal of Operational Research
Volume
181
Number
2
Publisher
Elsevier
Pages
620-633
Publication identifier
http://dx.doi.org/10.1016/j.ejor.2005.04.057
Metadata
Show full item record
Author(s)
Paschos, Vangelis
Escoffier, Bruno
Abstract (EN)
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.
Subjects / Keywords
NP-hard optimization problems; Polynomial approximation; Differential approximation; Satisfiability; Minimum satisfiability

Related items

Showing items related by title and author.

  • Thumbnail
    Differential approximation of MIN SAT, MAX SAT and related problems 
    Escoffier, Bruno; Paschos, Vangelis (2005) Communication / Conférence
  • Thumbnail
    Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms 
    Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis (2011) Article accepté pour publication ou publié
  • Thumbnail
    Using greediness for parameterization: the case of max and min (k, n − k)-cut 
    Bonnet, Édouard; Escoffier, Bruno; Paschos, Vangelis; Tourniaire, Emeric (2012) Document de travail / Working paper
  • Thumbnail
    Complexity and approximation results for the min weighted node coloring problem 
    Escoffier, Bruno; Demange, Marc; Paschos, Vangelis; de Werra, Dominique; Monnot, Jérôme (2008) Chapitre d'ouvrage
  • Thumbnail
    Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms 
    Escoffier, Bruno; Paschos, Vangelis; Tourniaire, Emeric (2014) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo