research
∙
11/03/2021
Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle
Given a k-vertex-connected graph G and a set S of extra edges (links), t...
share
research
∙
10/18/2021
Machine Covering in the Random-Order Model
In the Online Machine Covering problem jobs, defined by their sizes, arr...
research
∙
06/01/2021
A (2+ε)-Approximation Algorithm for Maximum Independent Set of Rectangles
We study the Maximum Independent Set of Rectangles (MISR) problem, where...
research
∙
05/18/2021
Approximation Algorithms for Demand Strip Packing
In the Demand Strip Packing problem (DSP), we are given a time interval ...
research
∙
03/18/2021
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More
In the 2-Dimensional Knapsack problem (2DK) we are given a square knapsa...
research
∙
01/23/2018
Improved Pseudo-Polynomial-Time Approximation for Strip Packing
We study the strip packing problem, a classical packing problem which ge...
research
∙
11/21/2017