research
∙
08/24/2023
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding
We study the Uniform Cardinality Constrained Multiple Knapsack problem (...
share
research
∙
07/17/2023
Tight Bounds for Budgeted Maximum Weight Independent Set in Bipartite and Perfect Graphs
We consider the classic budgeted maximum weight independent set (BMWIS) ...
research
∙
07/15/2023
Tight Lower Bounds for Weighted Matroid Problems
In this paper we derive tight lower bounds resolving the hardness status...
research
∙
07/09/2023
Budgeted Matroid Maximization: a Parameterized Viewpoint
We study budgeted variants of well known maximization problems with mult...
research
∙
04/27/2023
An FPTAS for Budgeted Laminar Matroid Independent Set
We study the budgeted laminar matroid independent set problem. The input...
research
∙
02/21/2023
Approximating Bin Packing with Conflict Graphs via Maximization Techniques
We give a comprehensive study of bin packing with conflicts (BPC). The i...
research
∙
02/11/2023
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection
We study the budgeted versions of the well known matching and matroid in...
research
∙
12/02/2022
Bin Packing with Partition Matroid can be Approximated within o(OPT) Bins
We consider the Bin Packing problem with a partition matroid constraint....
research
∙
09/10/2022
An EPTAS for Budgeted Matroid Independent Set
We consider the budgeted matroid independent set problem. The input is a...
research
∙
11/09/2020
