2 citations · 3 across the 6 of their papers we have counts for
3 papers · 1 filter
Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary
Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert
Designing dynamic algorithms against an adaptive adversary whose performance match the ones assuming an oblivious adversary is a major research program in the field of dynamic grap…
Individual Preference Stability for Clustering
Saba Ahmadi, Pranjal Awasthi, Samir Khuller +4
In this paper, we propose a natural notion of individual preference (IP) stability for clustering, which asks that every data point, on average, is closer to the points in its own…
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver
Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai +3
In the -edge-connected spanning subgraph (ECSS) problem, our goal is to compute a minimum-cost sub-network that is resilient against up to link failures: Given an -nod…