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...
share
research
∙
11/20/2018
Tight Approximation Ratio for Minimum Maximal Matching
We study a combinatorial problem called Minimum Maximal Matching, where ...
research
∙
05/15/2018
