research
∙
12/09/2021
Improved approximation algorithms for two Euclidean k-Center variants
The k-Center problem is one of the most popular clustering problems. Aft...
share
research
∙
08/04/2021
Node Connectivity Augmentation via Iterative Randomized Rounding
Many network design problems deal with the design of low-cost networks t...
research
∙
09/01/2020
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture
A well-known conjecture of Füredi, Kahn, and Seymour (1993) on non-unifo...
research
∙
07/08/2020
A Technique for Obtaining True Approximations for k-Center with Covering Constraints
There has been a recent surge of interest in incorporating fairness aspe...
research
∙
10/19/2018
Bilu-Linial stability, certified algorithms and the Independent Set problem
We study the notion of Bilu-Linial stability in the context of Independe...
research
∙
07/24/2018
