Show simple item record

dc.contributor.authorDella Croce, Federico
dc.contributor.authorEscoffier, Bruno
dc.contributor.authorKaminski, Marcin
dc.contributor.authorPaschos, Vangelis
dc.date.accessioned2010-05-06T08:26:33Z
dc.date.available2010-05-06T08:26:33Z
dc.date.issued2008
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/4107
dc.language.isoenen
dc.subjectNP-Hard Problemsen
dc.subject.ddc003en
dc.titleWorst-case complexity of exact algorithms for NP-hard problemsen
dc.typeChapitre d'ouvrage
dc.identifier.citationpages203-240en
dc.relation.ispartoftitleCombinatorial Optimization and Theoretical Computer Science: Interfaces and Perspectives: 30th anniversary of the LAMSADEen
dc.relation.ispartofeditorPaschos, Vangelis
dc.relation.ispartofpublnameWileyen
dc.relation.ispartofpublcityHoboken NJen
dc.relation.ispartofdate2008
dc.relation.ispartofpages515en
dc.description.sponsorshipprivateouien
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.ispartofisbn978-1-8482-1021-9en


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record