Veldt, Nate

9 publications

ICML 2025 Approximate Forest Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees Nate Veldt, Thomas Stanley, Benjamin W Priest, Trevor Steil, Keita Iwabuchi, T.S. Jayram, Geoffrey Sanders

ICML 2025 Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges Alex Crane, Thomas Stanley, Blair D. Sullivan, Nate Veldt

ECML-PKDD 2025 The Densest SWAMP Problem: Subhypergraphs with Arbitrary Monotonic Partial Edge Rewards Vedangi Bengali, Nikolaj Tatti, Iiro Kumpulainen, Florian Adriaens, Nate Veldt

ICML 2024 Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better Vicente Balmaseda, Ying Xu, Yixin Cao, Nate Veldt

JMLR 2023 Augmented Sparsifiers for Generalized Hypergraph Cuts Nate Veldt, Austin R. Benson, Jon Kleinberg

ICML 2023 Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs Nate Veldt

ICML 2022 Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds Nate Veldt

NeurIPS 2021 Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components Nate Veldt, Austin R Benson, Jon M. Kleinberg

ICML 2016 A Simple and Strongly-Local Flow-Based Method for Cut Improvement Nate Veldt, David Gleich, Michael Mahoney