• 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

Worst-case complexity of exact algorithms for NP-hard problems

Della Croce, Federico; Escoffier, Bruno; Kaminski, Marcin; Paschos, Vangelis (2008), Worst-case complexity of exact algorithms for NP-hard problems, in Paschos, Vangelis, Combinatorial Optimization and Theoretical Computer Science: Interfaces and Perspectives: 30th anniversary of the LAMSADE, Wiley : Hoboken NJ, p. 203-240. 10.1002/9780470611098.ch8

Type
Chapitre d'ouvrage
Date
2008
Book title
Combinatorial Optimization and Theoretical Computer Science: Interfaces and Perspectives: 30th anniversary of the LAMSADE
Book author
Paschos, Vangelis
Publisher
Wiley
Published in
Hoboken NJ
ISBN
978-1-8482-1021-9
Number of pages
515
Pages
203-240
Publication identifier
10.1002/9780470611098.ch8
Metadata
Show full item record
Author(s)
Della Croce, Federico
Escoffier, Bruno
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Kaminski, Marcin
Paschos, Vangelis
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Subjects / Keywords
NP-Hard Problems

Related items

Showing items related by title and author.

  • Thumbnail
    Improved worst-case complexity for the MIN 3-SET COVERING problem 
    Paschos, Vangelis; Della Croce, Federico; Escoffier, Bruno (2007) Article accepté pour publication ou publié
  • Thumbnail
    An Introduction to Exponential Time Exact Algorithms for Solving NP-hard Problems 
    Paschos, Vangelis; Escoffier, Bruno; Bourgeois, Nicolas (2011) Chapitre d'ouvrage
  • Thumbnail
    Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems 
    Paschos, Vangelis; Della Croce, Federico (2008) Article accepté pour publication ou publié
  • Thumbnail
    Exact Algorithms for Dominating Clique Problems 
    Bourgeois, Nicolas; Della Croce, Federico; Escoffier, Bruno; Paschos, Vangelis (2009) Communication / Conférence
  • Thumbnail
    An exact algorithm for MAX CUT in sparse graphs 
    Kaminski, Marcin; Della Croce, Federico; Paschos, Vangelis (2007) 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