Veldt, Nate

1. Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds
   2021/11/20 by Nate Veldt, Veldt, Nate · 3 citations
   Computer Science · #Data Management and Algorithms #Advanced Clustering Algorithms Research #Data Visualization and Analytics
2. Hypergraph Cuts with General Splitting Functions
   2020/01/09 by Nate Veldt, Austin R. Benson, Veldt, Nate +3 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
3. Hypergraph Clustering for Finding Diverse and Experienced Groups
   2020/06/10 by Amburg, Ilya, Veldt, Nate, Benson, Austin R. · 1 citation
   #FOS: Computer and information sciences #FOS: Physical sciences #Information Retrieval (cs.IR) #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Physics and Society (physics.soc-ph) #Social and Information Networks (cs.SI)
4. Augmented Sparsifiers for Generalized Hypergraph Cuts with Applications\n to Decomposable Submodular Function Minimization
   2020/07/15 by Austin R. Benson, Benson, Austin R., Jon Kleinberg +3 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Machine Learning and Algorithms #Optimization and Search Problems
5. The Generalized Mean Densest Subgraph Problem
   2021/06/02 by Veldt, Nate, Benson, Austin R., Kleinberg, Jon · 1 citation
   #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Social and Information Networks (cs.SI)