7 citations · 8 across the 10 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
A 4-approximation algorithm for min max correlation clustering
Holger Heidrich, Jannik Irmai, Bjoern Andres
We introduce a lower bounding technique for the min max correlation clustering problem and, based on this technique, a combinatorial 4-approximation algorithm for complete graphs.…
cs.DS2021★ 7 cited
The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower's Objective
Christoph Buchheim, Dorothee Henke, Jannik Irmai
We consider a bilevel continuous knapsack problem where the leader controls the capacity of the knapsack, while the follower chooses a feasible packing maximizing his own profit. T…