2 citations · 2 across the 3 of their papers we have counts for
3 papers
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.DS2016
Algorithmic and Hardness Results for the Hub Labeling Problem
Haris Angelidakis, Yury Makarychev, Vsevolod Oparin
There has been significant success in designing highly efficient algorithms for distance and shortest-path queries in recent years; many of the state-of-the-art algorithms use the…
cs.DS2016★ 2 cited
An Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation for Multiway Cut
Haris Angelidakis, Yury Makarychev, Pasin Manurangsi
We construct an improved integrality gap instance for the Calinescu-Karloff-Rabani LP relaxation of the Multiway Cut problem. In particular, for terminals, our inst…