Networks

PACE 2018 winners announced

Bart Jansen was, for the third year in row, one of the organizers of the Parameterized Algorithms and Computational Experiments (PACE 2018).

 

PACE 2018This 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. Over 80 participants on 40 teams from 16 countries submitted their implementations to the competition.

 

The winners of PACE 2018 are:

 

Track A:  
1st place:

Yoichi Iwata and Takuto Shigemura (team wata&sigma from Japanese National

Institute of Informatics and University of Tokyo) 

2nd place:  Krzysztof Maziarz and Adam Polak (team Jagiellonian from Jagiellonian University) 
3rd place: Thorsten Koch and Daniel Rehfeldt (team reko from Zuse Institute Berlin and TU Berlin) 
4th place: Andre Schidler, Johannes Fichte and Markus Hecher (team TUW from TU Vienna) 

 

Track B:

 
1st place: Thorsten Koch and Daniel Rehfeldt (team reko from Zuse Institute Berlin and TU Berlin) 
2nd place:

Yoichi Iwata and Takuto Shigemura (team wata&sigma from the Japanese National

Institute of Informatics and the University of Tokyo)

3rd place: Tom van der Zanden (team Tom from Utrecht University) 

 

Track C:

 
1st place:

Emmanuel Romero Ruiz, Emmanuel Antonio Cuevas, Irwin Enrique Villalobos López

and Carlos Segura González (CIMAT Team from the Center for Research in Mathematics,

Guanajuato)

2nd place: Thorsten Koch and Daniel Rehfeldt (team reko from Zuse Institute Berlin and TU Berlin) 
3rd place: Martin Josef Geiger (team MJG from HSU Hamburg) 
4th place:

Radek Hušek, Tomáš Toufar, Dušan Knop, Tomáš Masařík and Eduard Eiben

(team CUiB from Charles University, Prague and University of Bergen) 

   
Travel award: Daniel Rehfeldt

 

Windows Photo Editor 10.0.10011.16384

 

 

 

 

 

 

 

 

 

 

 

Tom van der Zanden accepts his prize

 

Full report of PACE 2018