Showing cs.DMShow all
3 papers · 1 filter
cs.DM2017
Computational Methods for Path-based Robust Flows
Fabian Mies, Britta Peis, Andreas Wierz
Real world networks are often subject to severe uncertainties which need to be addressed by any reliable prescriptive model. In the context of the maximum flow problem subject to a…
cs.DM2012
Abstract flows over time: A first step towards solving dynamic packing problems
Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis
Flows over time generalize classical network flows by introducing a notion of time. Each arc is equipped with a transit time that specifies how long flow takes to traverse it, whil…
cs.DM2012
Lattices and maximum flow algorithms in planar graphs
Jannik Matuschke, Britta Peis
We show that the left/right relation on the set of s-t-paths of a plane graph induces a so-called submodular lattice. If the embedding of the graph is s-t-planar, this lattice is e…