1 citations · 1 across the 4 of their papers we have counts for
4 papers
To Store or Not to Store: a graph theoretical approach for Dataset Versioning
Anxin Guo, Jingwei Li, Pattara Sukprasert +3
In this work, we study the cost efficient data versioning problem, where the goal is to optimize the storage and reconstruction (retrieval) costs of data versions, given a graph of…
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs
Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala +1
The densest subgraph problem has received significant attention, both in theory and in practice, due to its applications in problems such as community detection, social network ana…
Constant Approximation for Individual Preference Stable Clustering
Anders Aamand, Justin Y. Chen, Allen Liu +4
Individual preference (IP) stability, introduced by Ahmadi et al. (ICML 2022), is a natural clustering objective inspired by stability and fairness constraints. A clustering is …
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…