2 citations · 2 across the 7 of their papers we have counts for
3 papers · 1 filter
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…
Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
Nate Veldt, Thomas Stanley, Benjamin W. Priest +4
Finding a minimum spanning tree (MST) for points in an arbitrary metric space is a fundamental primitive for hierarchical clustering and many other ML tasks, but this takes $Ω(…
Scalable Edge Clustering of Dynamic Graphs via Weighted Line Graphs
Michael Ostroski, Geoffrey Sanders, Trevor Steil +1
Timestamped relational datasets consisting of records between pairs of entities are ubiquitous in data and network science. For applications like peer-to-peer communication, email,…