35 citations · 49 across the 7 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DM2016★ 12 cited
Robust Flows over Time: Models and Complexity Results
Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers +3
We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the…
math.CO2016
A flow based pruning scheme for enumerative equitable coloring algorithms
Arie Koster, Robert Schweidweiler, Martin Tieves
An equitable graph coloring is a proper vertex coloring of a graph G where the sizes of the color classes differ by at most one. The equitable chromatic number is the smallest numb…