Show simple item record

dc.contributor.authorBonnet, Edouard
dc.contributor.authorSikora, Florian
dc.date.accessioned2019-03-21T09:26:13Z
dc.date.available2019-03-21T09:26:13Z
dc.date.issued2018
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/18541
dc.language.isoenen
dc.subjectSteiner tree problemen
dc.subjectcontesten
dc.subjectimplementation challengeen
dc.subjectFPTen
dc.subject.ddc518en
dc.titleThe PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iterationen
dc.typeCommunication / Conférence
dc.description.abstractenThe Program Committee of the Third Parameterized Algorithms and Computational Experiments challenge (PACE 2018) reports on the third iteration of the PACE challenge. This year, all three tracks were dedicated to solve the Steiner Tree problem, in which, given an edge-weighted graph and a subset of its vertices called terminals, one has to find a minimum-weight subgraph which spans all the terminals. In Track A, the number of terminals was limited. In Track B, a tree-decomposition of the graph was provided in the input, and the treewidth was limited. Finally, Track C welcomed heuristics. Over 80 participants on 40 teams from 16 countries submitted their implementations to the competition.en
dc.identifier.citationpages26:1-26:15en
dc.relation.ispartoftitle13th International Symposium on Parameterized and Exact Computation (IPEC 2018)en
dc.relation.ispartofeditorPaul, Christophe
dc.relation.ispartofeditorPilipczuk, Michal
dc.relation.ispartofpublnameSchloss Dagstuhl--Leibniz-Zentrum fuer Informatiken
dc.relation.ispartofpublcityWadernen
dc.relation.ispartofdate2018
dc.subject.ddclabelModèles mathématiques. Algorithmesen
dc.relation.ispartofisbn978-3-95977-084-2en
dc.relation.conftitleIPEC 2018en
dc.relation.confdate2018-08
dc.relation.confcityHelsinkien
dc.relation.confcountryFinlanden
dc.relation.forthcomingnonen
dc.identifier.doi10.4230/LIPIcs.IPEC.2018.26en
dc.description.ssrncandidatenonen
dc.description.halcandidateouien
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewednonen
dc.relation.Isversionofjnlpeerreviewednonen
dc.date.updated2019-03-21T09:18:56Z
hal.person.labIds35418
hal.person.labIds989
hal.faultCode{"duplicate-entry":{"hal-01991645":{"doi":"1.0"}}}


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record