research
∙
05/24/2023
Algorithms for the Bin Packing Problem with Scenarios
This paper presents theoretical and practical results for the bin packin...
share
research
∙
05/25/2022
A parameterized approximation algorithm for the Multiple Allocation k-Hub Center
In the Multiple Allocation k-Hub Center (MAkHC), we are given a connecte...
research
∙
07/09/2020
Computing the Largest Bond and the Maximum Connected Cut of a Graph
The cut-set ∂(S) of a graph G=(V,E) is the set of edges that have one en...
research
∙
06/24/2020
Approximation algorithms for the MAXSPACE advertisement problem
In the MAXSPACE problem, given a set of ads A, one wants to schedule a s...
research
∙
10/02/2019
