12 citations · 42 across the 15 of their papers we have counts for
4 papers · 1 filter
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…
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…
Max-Flow on Regular Spaces
Ulrich Faigle, Walter Kern, Britta Peis
The max-flow and max-coflow problem on directed graphs is studied in the common generalization to regular spaces, i.e., to kernels or row spaces of totally unimodular matrices. Exh…
Resource Buying Games
Tobias Harks, Britta Peis
In resource buying games a set of players jointly buys a subset of a finite resource set E (e.g., machines, edges, or nodes in a digraph). The cost of a resource e depends on the n…