• 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

An Introduction to Exponential Time Exact Algorithms for Solving NP-hard Problems

Paschos, Vangelis; Escoffier, Bruno; Bourgeois, Nicolas (2011), An Introduction to Exponential Time Exact Algorithms for Solving NP-hard Problems, in Mahjoub, Ridha, Progress in Combinatorial Optimization: Recent Progress, Wiley - ISTE, p. chapter 15

Type
Chapitre d'ouvrage
Date
2011
Book title
Progress in Combinatorial Optimization: Recent Progress
Book author
Mahjoub, Ridha
Publisher
Wiley - ISTE
ISBN
9781848212060
Number of pages
416
Pages
chapter 15
Metadata
Show full item record
Author(s)
Paschos, Vangelis
Escoffier, Bruno
Bourgeois, Nicolas
Subjects / Keywords
NP-hard Problems

Related items

Showing items related by title and author.

  • Thumbnail
    Worst-case complexity of exact algorithms for NP-hard problems 
    Della Croce, Federico; Escoffier, Bruno; Kaminski, Marcin; Paschos, Vangelis (2008) Chapitre d'ouvrage
  • Thumbnail
    An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs 
    Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis (2008) Communication / Conférence
  • Thumbnail
    Exact Algorithms for Dominating Clique Problems 
    Bourgeois, Nicolas; Della Croce, Federico; Escoffier, Bruno; Paschos, Vangelis (2009) Communication / Conférence
  • Thumbnail
    Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms 
    Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis (2009) 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é
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