research
∙
09/19/2023
Improved guarantees for the a priori TSP
We revisit the a priori TSP (with independent activation) and prove stro...
share
research
∙
05/13/2023
The 2-3-Set Packing problem and a 4/3-approximation for the Maximum Leaf Spanning Arborescence problem in rooted dags
The weighted 3-Set Packing problem is defined as follows: As input, we a...
research
∙
02/16/2022
The Pareto cover problem
We introduce the problem of finding a set B of k points in [0,1]^n such ...
research
∙
02/02/2022
Passing the Limits of Pure Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs
In this paper, we consider the task of computing an independent set of m...
research
∙
06/07/2021
The Limits of Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs
We consider the Maximum Weight Independent Set Problem (MWIS) in d-claw ...
research
∙
06/07/2021
An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs
In this paper, we consider the task of computing an independent set of m...
research
∙
03/11/2021
Reducing Moser's Square Packing Problem to a Bounded Number of Squares
The problem widely known as Moser's Square Packing Problem asks for the ...
research
∙
01/21/2021
