Show simple item record

dc.contributor.authorEscoffier, Bruno
HAL ID: 5124
dc.contributor.authorDemange, Marc
dc.contributor.authorPaschos, Vangelis
dc.contributor.authorde Werra, Dominique
dc.contributor.authorMonnot, Jérôme
HAL ID: 178759
ORCID: 0000-0002-7452-6553
dc.date.accessioned2009-07-17T13:34:08Z
dc.date.available2009-07-17T13:34:08Z
dc.date.issued2008
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/1206
dc.language.isoenen
dc.subjectOptimisation combinatoireen
dc.subject.ddc003en
dc.titleComplexity and approximation results for the min weighted node coloring problemen
dc.typeChapitre d'ouvrage
dc.contributor.editoruniversityotherÉcole Polytechnique Fédérale de Lausanne;Suisse
dc.contributor.editoruniversityotherUniversité Panthéon-Sorbonne - Paris I;France
dc.contributor.editoruniversityotherESSEC;France
dc.identifier.citationpages251-280en
dc.relation.ispartoftitleCombinatorial optimization and theoretical computer science: interfaces and perspectivesen
dc.relation.ispartofeditorPaschos, Vangelis
dc.relation.ispartofpublnameWiley - ISTEen
dc.relation.ispartofdate2008
dc.relation.ispartofpages515en
dc.description.sponsorshipprivateouien
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.ispartofisbn9781848210219en


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