10 citations · 23 across the 8 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2022★ 5 cited
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth
Laxman Dhulipala, David Eisenstat, Jakub Łącki +2
Obtaining scalable algorithms for hierarchical agglomerative clustering (HAC) is of significant interest due to the massive size of real-world datasets. At the same time, efficient…
cs.DS2021★ 10 cited
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time
Laxman Dhulipala, David Eisenstat, Jakub Łącki +2
We study the widely used hierarchical agglomerative clustering (HAC) algorithm on edge-weighted graphs. We define an algorithmic framework for hierarchical agglomerative graph clus…
cs.DS2011
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
David Eisenstat, Philip Klein, Claire Mathieu
We give an approximation scheme for Steiner forest in planar graphs, improving on the previous approximation scheme for this problem, which runs in ti…