6 citations · 6 across the 7 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023
A parameterized approximation scheme for the 2D-Knapsack problem with wide items
Michal Pilipczuk, Mathieu Mari, Timothe Picavet
We study a natural geometric variant of the classic Knapsack problem called 2D-Knapsack: we are given a set of axis-parallel rectangles and a rectangular bounding box, and the goal…
cs.GT2023
On price-induced minmax matchings
Christoph Dürr, Mathieu Mari, Ulrike Schmidt-Kraepelin
We study a natural combinatorial pricing problem for sequentially arriving buyers with equal budgets. Each buyer is interested in exactly one pair of items and purchases this pair…