…Each instance is an undirected graph. Track 1 is the "exact with low number of terminals" track, Track 2 is the "exact with low treewidth track", and Track 3 is the heuristic track. Graphs have sizes (number of vertices) ranging up to several thousand for exact tracks (1 and 2), and up to tens of thousands for the heuristic track.
4 PAPERS • NO BENCHMARKS YET