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
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