1 citations · 1 across the 4 of their papers we have counts for
4 papers
Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling
Vedangi Bengali, Nate Veldt
Graph clustering is a fundamental task in network analysis where the goal is to detect sets of nodes that are well-connected to each other but sparsely connected to the rest of the…
On the Optimal Recovery of Graph Signals
Simon Foucart, Chunyang Liao, Nate Veldt
Learning a smooth graph signal from partially observed data is a well-studied task in graph-based machine learning. We consider this task from the perspective of optimal recovery,…
Seven open problems in applied combinatorics
Sinan G. Aksoy, Ryan Bennink, Yuzhou Chen +10
We present and discuss seven different open problems in applied combinatorics. The application areas relevant to this compilation include quantum computing, algorithmic differentia…
Cut-matching Games for Generalized Hypergraph Ratio Cuts
Nate Veldt
Hypergraph clustering is a basic algorithmic primitive for analyzing complex datasets and systems characterized by multiway interactions, such as group email conversations, groups…