1 citations · 2 across the 3 of their papers we have counts for
3 papers
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…
cs.DS2016★ 1 cited
On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
We investigate the complexity and approximability of the budget-constrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a secon…