3 citations · 6 across the 7 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2019★ 3 cited
The Product Knapsack Problem: Approximation and Complexity
Ulrich Pferschy, Joachim Schauer, Clemens Thielen
We consider the product knapsack problem, which is the variant of the classical 0-1 knapsack problem where the objective consists of maximizing the product of the profits of the se…
math.OC2015
The data arrangement problem on binary trees
Eranda Cela, Joachim Schauer, Rostislav Stanek
The data arrangement problem on regular trees (DAPT) consists in assigning the vertices of a given graph G, called the guest graph, to the leaves of a d-regular tree T, called the…