19 citations · 61 across the 20 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.DS2017
An FPTAS for the Knapsack Problem with Parametric Weights
Michael Holzhauser, Sven O. Krumke
In this paper, we investigate the parametric weight knapsack problem, in which the item weights are affine functions of the form for $i \in \{1,\ldots,n…
cs.DS2017★ 1 cited
An FPTAS for the parametric knapsack problem
Michael Holzhauser, Sven O. Krumke
In this paper, we investigate the parametric knapsack problem, in which the item profits are affine functions depending on a real-valued parameter. The aim is to provide a solution…
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…