• 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 - Request a copy

When polynomial approximation meets exact computation

Paschos, Vangelis (2015), When polynomial approximation meets exact computation, 4OR, 13, 3, p. 227-245. 10.1007/s10288-015-0294-7

Type
Article accepté pour publication ou publié
Date
2015
Journal name
4OR
Volume
13
Number
3
Publisher
Springer
Pages
227-245
Publication identifier
10.1007/s10288-015-0294-7
Metadata
Show full item record
Author(s)
Paschos, Vangelis
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
We outline a relatively new research agenda aiming at building a new approximation paradigm by matching two distinct domains, the polynomial approximation and the exact solution of NP -hard problems by algorithms with guaranteed and non-trivial upper complexity bounds. We show how one can design approximation algorithms achieving ratios that are “forbidden” in polynomial time (unless a very unlikely complexity conjecture is confirmed) with worst-case complexity much lower than that of an exact computation.
Subjects / Keywords
Complexity; Polynomial approximation; Exact algorithm; Moderately exponential approximation

Related items

Showing items related by title and author.

  • Thumbnail
    Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation 
    Paschos, Vangelis (2013) Communication / Conférence
  • Thumbnail
    Quelques étapes vers la conciliation de la théorie d'approximation et celle d'optimisation : une nouvelle théorie d'approximation polynomiale et résultats préliminaires 
    Demange, Marc; Paschos, Vangelis (1993) Article accepté pour publication ou publié
  • Thumbnail
    On an approximation measure founded on the links between optimization and polynomial approximation theory 
    Demange, Marc; Paschos, Vangelis (1996) Article accepté pour publication ou publié
  • Thumbnail
    Exact and superpolynomial approximation algorithms for the densest k-subgraph problem 
    Bourgeois, Nicolas; Giannakos, Aristotelis; Lucarelli, Giorgio; Milis, Ioannis; Paschos, Vangelis (2017) Article accepté pour publication ou publié
  • Thumbnail
    Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems 
    Bonnet, Édouard; Paschos, Vangelis; Sikora, Florian (2016) 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