1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.GT2021
Computing the egalitarian allocation with network flows
T. Heller, S. O. Krumke
In a combinatorial exchange setting, players place sell (resp. buy) bids on combinations of traded goods. Besides the question of finding an optimal selection of winning bids, the…
math.CO2017★ 1 cited
Minimum Cycle Decomposition: A Constructive Characterization for Graphs of Treewidth Two with Node Degrees Two and Four
Irene Heinrich, Sven O. Krumke
Substantial efforts have been made to compute or estimate the minimum number of cycles needed to partition the edges of an Eulerian graph. We give an equivalent characteriza…
cs.DS2016
A Generalized Approximation Framework for Fractional Network Flow and Packing Problems
Michael Holzhauser, Sven O. Krumke
We generalize the fractional packing framework of Garg and Koenemann to the case of linear fractional packing problems over polyhedral cones. More precisely, we provide approximati…