research
∙
05/18/2023
Submodularity Gaps for Selected Network Design and Matching Problems
Submodularity in combinatorial optimization has been a topic of many stu...
share
research
∙
10/28/2021
Online Facility Location with Linear Delay
We study the problem of online facility location with delay. In this pro...
research
∙
11/16/2020
To Close Is Easier Than To Open: Dual Parameterization To k-Median
The k-Median problem is one of the well-known optimization problems that...
research
∙
06/18/2020
A Competitive B-Matching Algorithm for Reconfigurable Datacenter Networks
This paper initiates the study of online algorithms for the maintaining ...
research
∙
11/20/2018
Tight Approximation Ratio for Minimum Maximal Matching
We study a combinatorial problem called Minimum Maximal Matching, where ...
research
∙
09/16/2018
