• 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

Completeness in differential approximation classes

Ausiello, Giorgio; Bazgan, Cristina; Demange, Marc; Paschos, Vangelis (2003), Completeness in differential approximation classes, in Vojtas, Peter, Mathematical Foundations of Computer Science 2003 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings, Springer : Berlin Heidelberg, p. 179-188

View/Open
completeness_bazgan.PDF (184.3Kb)
Type
Communication / Conférence
Date
2003
Conference country
SLOVAKIA
Book title
Mathematical Foundations of Computer Science 2003 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings
Book author
Vojtas, Peter
Publisher
Springer
Published in
Berlin Heidelberg
ISBN
978-3-540-40671-6
Pages
179-188
Metadata
Show full item record
Author(s)
Ausiello, Giorgio
Bazgan, Cristina
Demange, Marc
Paschos, Vangelis
Abstract (EN)
We study completeness in differential approximability classes. In differential approximation, the quality of an approximation algorithm is the measure of both how far is the solution computed from a worst one and how close is it to an optimal one. The main classes considered are DAPX, the differential counterpart of APX, including the NP optimization problems approximable in polynomial time within constant differential approximation ratio and the DGLO, the differential counterpart of GLO, including problems for which their local optima guarantee constant differential approximation ratio. We define natural approximation preserving reductions and prove completeness results for the class of the NP optimization problems (class NPO), as well as for DAPX and for a natural subclass of DGLO. We also define class 0-APX of the NPO problems that are not differentially approximable within any ratio strictly greater than 0 unless P = NP. This class is very natural for differential approximation, although has no sense for the standard one. Finally, we prove the existence of hard problems for a subclass of DPTAS, the differential counterpart of PTAS, the class of NPO problems solvable by polynomial time differential approximation schemata.
Subjects / Keywords
approximability; completeness

Related items

Showing items related by title and author.

  • Thumbnail
    Completeness in differential approximation classes 
    Ausiello, Giorgio; Bazgan, Cristina; Demange, Marc; Paschos, Vangelis (2005) Article accepté pour publication ou publié
  • Thumbnail
    Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness 
    Bazgan, Cristina; Escoffier, Bruno; Paschos, Vangelis (2005) Article accepté pour publication ou publié
  • Thumbnail
    Poly-APX- and PTAS-completeness in standard and differential approximation 
    Bazgan, Cristina; Escoffier, Bruno; Paschos, Vangelis (2004) Communication / Conférence
  • Thumbnail
    Algorithms for the on-line quota traveling salesman problem 
    Ausiello, Giorgio; Demange, Marc; Laura, Luigi; Paschos, Vangelis (2004) Article accepté pour publication ou publié
  • Thumbnail
    Algorithms for the on-line quota traveling salesman problem 
    Ausiello, Giorgio; Demange, Marc; Laura, Luigi; Paschos, Vangelis (2004) Communication / Conférence
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