activity
20162021
most citedBilu-Linial stability, certified algorithms and the Independent Set problem

3 citations · 5 across the 7 of their papers we have counts for

collaborators
Showing 2021Show all

2 papers · 1 filter

cs.DS2021

Improved approximation algorithms for two Euclidean k-Center variants

Haris Angelidakis, Ivan Sergeev, Pontus Westermark

The -Center problem is one of the most popular clustering problems. After decades of work, the complexity of most of its variants on general metrics is now well understood. Surp…

cs.DS2021

Node Connectivity Augmentation via Iterative Randomized Rounding

Haris Angelidakis, Dylan Hyatt-Denesik, Laura Sanità

Many network design problems deal with the design of low-cost networks that are resilient to the failure of their elements, such as nodes or links. One such problem is Connectivity…