5 papers · 1 filter
Improved Parallel Algorithms for EF1 Allocations
Kishen N Gowda, D Ellis Hershkowitz, Richard Z Huang +1
Allocating indivisible goods among agents is a fundamental task in fair division. Recent work of Garg and Psomas [AAMAS 2025] initiated the study of parallel algorithms for…
The Steiner Path Aggregation Problem
Da Qi Chen, Daniel Hathcock, D Ellis Hershkowitz +1
In the Steiner Path Aggregation Problem, our goal is to aggregate paths in a directed network into a single arborescence without significantly disrupting the paths. In particular,…
Parallel Hierarchical Agglomerative Clustering in Low Dimensions
MohammadHossein Bateni, Laxman Dhulipala, Willem Fletcher +4
Hierarchical Agglomerative Clustering (HAC) is an extensively studied and widely used method for hierarchical clustering in based on repeatedly merging the closest p…
Simple Length-Constrained Minimum Spanning Trees
D Ellis Hershkowitz, Richard Z Huang
In the length-constrained minimum spanning tree (MST) problem, we are given an -node edge-weighted graph and a length constraint . Our goal is to find a spanning t…
It's Hard to HAC with Average Linkage!
MohammadHossein Bateni, Laxman Dhulipala, Kishen N Gowda +3
Average linkage Hierarchical Agglomerative Clustering (HAC) is an extensively studied and applied method for hierarchical clustering. Recent applications to massive datasets have d…