69 citations · 180 across the 32 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.DS2026
Query Complexity of Densest Sub(hyper)graph Problems
Sinan G. Aksoy, Eli Friedman, Nate Veldt +1
Rubinstein et al. introduce the study of connectivity and minimum cut problems in the cut query model, where an algorithm can only access the edges of a graph through CUT queries.…
cs.DS2026
An Improved Combinatorial Algorithm for Edge-Colored Clustering in Hypergraphs
Seongjune Han, Nate Veldt
Many complex systems and datasets are characterized by multiway interactions of different categories, and can be modeled as edge-colored hypergraphs. We focus on clustering such da…
cs.DS2026
Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion
Nate Veldt, Thomas Stanley, Benjamin W. Priest +5
We present improved learning-augmented algorithms for finding an approximate minimum spanning tree (MST) for points in an arbitrary metric space. Our work follows a recent framewor…