• 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 - No thumbnail

Moderate exponential time approximation and branching algorithms

Escoffier, Bruno; Paschos, Vangelis; Tourniaire, Emeric (2012), Moderate exponential time approximation and branching algorithms. https://basepub.dauphine.fr/handle/123456789/12146

Type
Document de travail / Working paper
External document link
https://hal.archives-ouvertes.fr/hal-00874358
Date
2012
Publisher
Université Paris-Dauphine
Series title
Cahiers du Lamsade
Published in
Paris
Pages
16
Metadata
Show full item record
Author(s)
Escoffier, Bruno
Paschos, Vangelis
Tourniaire, Emeric
Abstract (EN)
We study links between approximation, exponential time computation and fixed parameter tractability. In particular, rather than focusing on one particular optimization problem, we tackle the question of finding sufficient conditions for a problem to admit "good" approximation algorithms in exponential time. In particular, we focus on the existence of "approximation schemata" (ratios 1 ± ε for arbitrarily small ε) and we exhibit conditions under which a technique of devising approximate branching algorithms reaches interesting results.
Subjects / Keywords
Complexité; Algorithme et structure de données

Related items

Showing items related by title and author.

  • Thumbnail
    Super-polynomial approximation branching algorithms 
    Escoffier, Bruno; Paschos, Vangelis; Tourniaire, Emeric (2016) Article accepté pour publication ou publié
  • Thumbnail
    Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms 
    Escoffier, Bruno; Paschos, Vangelis; Tourniaire, Emeric (2014) Article accepté pour publication ou publié
  • Thumbnail
    Approximating MAX SAT by moderately exponential algorithms 
    Escoffier, Bruno; Paschos, Vangelis; Tourniaire, Emeric (2012) 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
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