Nate Veldt
8 papers · 2016–2025 · 3 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+1 more ↓ Show less ↑
π Conference Polyglot Β· Bronze π Academic Marathon Β· Sprint π Interdisciplinary Bridge Β· Silver πΊοΈ Taxonomy Completionist (11) π£ Hot Topic Early Bird
π₯
Unstoppable Β· Bronze
Venues
Top co-authors
Research topics
Keywords
approximation algorithm
(5)
combinatorial optimization
(4)
graph cut
(3)
linear programming
(2)
hypergraph clustering
(2)
submodular minimization
(1)
graph
(1)
combinatorial algorithm
(1)
correlation clustering
(1)
graph sparsification
(1)
local algorithm
(1)
metric space
(1)
linear program
(1)
minimum spanning tree
(1)
cluster editing
(1)
strong triadic closure
(1)
edge-colored hypergraph
(1)
integrality gap
(1)
edge deletion
(1)
subquadratic time
(1)
Papers
Approximate Forest Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
ICML 2025
Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
ICML 2025
Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better
ICML 2024
Augmented Sparsifiers for Generalized Hypergraph Cuts
JMLR 2023
Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs
ICML 2023
Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds
ICML 2022
Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components
NeurIPS 2021
A Simple and Strongly-Local Flow-Based Method for Cut Improvement
ICML 2016