3 papers
cs.DS2022
Approximate Parametric Computation of Minimum-Cost Flows with Convex Costs
Per Joachims, Max Klimm, Philipp Warode
This paper studies a variant of the minimum-cost flow problem in a graph with convex cost function where the demands at the vertices are functions depending on a one-dimensional pa…
cs.GT2018
Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians
Max Klimm, Philipp Warode
We show that computing an equilibrium in atomic splittable congestion games with player-specific affine cost functions is -complet…
cs.GT2018
Computing all Wardrop Equilibria parametrized by the Flow Demand
Max Klimm, Philipp Warode
We develop an algorithm that computes for a given undirected or directed network with flow-dependent piece-wise linear edge cost functions all Wardrop equilibria as a function of t…