• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Polynomial approximation algorithms with performance guarantees: an introduction-by-example

Thumbnail
Date
2005
Dewey
Recherche opérationnelle
Sujet
Traveling salesman; Complexity theory; Computing science; Combinatorial optimization
Journal issue
European Journal of Operational Research
Volume
165
Number
3
Publication date
2005
Article pages
555-568
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.ejor.2004.03.021
URI
https://basepub.dauphine.fr/handle/123456789/2204
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Demange, Marc
Paschos, Vangelis
Type
Article accepté pour publication ou publié
Abstract (EN)
We present a short overview on polynomial approximation of NP-hard problems. We present the main approximability classes together with examples of problems belonging to them. We also describe the general concept of approximability preserving reductions together with a discussion about their capacities and their limits. Finally, we present a quick description of what it is commonly called inapproximability results. Such results provide limits on the approximability of the problems tackled.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.