35 citations · 49 across the 7 of their papers we have counts for
7 papers
Robust transshipment problem under consistent flow constraints
Christina Büsing, Arie M. C. A Koster, Sabrina Schmitz
In this paper, we study robust transshipment under consistent flow constraints. We consider demand uncertainty represented by a finite set of scenarios and characterize a subset of…
Robust Minimum Cost Flow Problem Under Consistent Flow Constraints
Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz
The robust minimum cost flow problem under consistent flow constraints (RobMCF) is a new extension of the minimum cost flow (MCF) problem. In the RobMCF problem, we…
On the Burning Number of -Caterpillars
Michaela Hiller, Eberhard Triesch, Arie M. C. A. Koster
The burning number is a recently introduced graph parameter indicating the spreading speed of content in a graph through its edges. While the conjectured upper bound on the necessa…
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…
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…
Optimal offline virtual network embedding with rent-at-bulk aspects
Stefano Coniglio, Boris Grimm, Arie M. C. A. Koster +2
Network virtualization techniques allow for the coexistence of many virtual networks (VNs) jointly sharing the resources of an underlying substrate network. The Virtual Network Emb…