• 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

Escoffier, Bruno; Paschos, Vangelis (2005), Differential approximation of MIN SAT, MAX SAT and related problems, in Gervasi, Osvaldo; Gavrilova, Marina; Kumar, Vipin; Lagana, Antonio; Lee, Heow Pueh; Mun, Youngsong; Taniar, David; Tan, Chih Jeng Kenneth, Computational Science and Its Applications - ICCSA 2005 International Conference, Singapore, May 9-12, 2005, Proceedings, Part IV, Springer : Berlin, p. 192-201. http://dx.doi.org/10.1007/11424925_22

View/Open
diffrential_escoffier.PDF (227.3Kb)
Type
Communication / Conférence
Date
2005
Conference title
International Conference on Computational Science and Its Applications (ICCSA'05)
Conference date
2005-05
Conference city
Singapour
Conference country
Singapour
Book title
Computational Science and Its Applications - ICCSA 2005 International Conference, Singapore, May 9-12, 2005, Proceedings, Part IV
Book author
Gervasi, Osvaldo; Gavrilova, Marina; Kumar, Vipin; Lagana, Antonio; Lee, Heow Pueh; Mun, Youngsong; Taniar, David; Tan, Chih Jeng Kenneth
Publisher
Springer
Series title
Lecture Notes in Computer Science
Series number
3483
Published in
Berlin
ISBN
978-3-540-25863-6
Number of pages
1362
Pages
192-201
Publication identifier
http://dx.doi.org/10.1007/11424925_22
Metadata
Show full item record
Author(s)
Escoffier, Bruno
Paschos, Vangelis
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
Approximation algorithms

Related items

Showing items related by title and author.

  • Thumbnail
    Differential approximation of MIN SAT, MAX SAT and related problems 
    Paschos, Vangelis; Escoffier, Bruno (2007) Article accepté pour publication ou publié
  • 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