Picture for Nate Veldt

Nate Veldt

Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better

Add code
Apr 24, 2024
Viaarxiv icon

Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling

Add code
Jun 08, 2023
Figure 1 for Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling
Figure 2 for Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling
Figure 3 for Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling
Figure 4 for Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling
Viaarxiv icon

On the Optimal Recovery of Graph Signals

Add code
Apr 02, 2023
Figure 1 for On the Optimal Recovery of Graph Signals
Figure 2 for On the Optimal Recovery of Graph Signals
Figure 3 for On the Optimal Recovery of Graph Signals
Figure 4 for On the Optimal Recovery of Graph Signals
Viaarxiv icon

Seven open problems in applied combinatorics

Add code
Mar 20, 2023
Viaarxiv icon

Faster Deterministic Approximation Algorithms for Correlation Clustering and Cluster Deletion

Add code
Nov 20, 2021
Figure 1 for Faster Deterministic Approximation Algorithms for Correlation Clustering and Cluster Deletion
Figure 2 for Faster Deterministic Approximation Algorithms for Correlation Clustering and Cluster Deletion
Figure 3 for Faster Deterministic Approximation Algorithms for Correlation Clustering and Cluster Deletion
Figure 4 for Faster Deterministic Approximation Algorithms for Correlation Clustering and Cluster Deletion
Viaarxiv icon

Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components

Add code
Oct 28, 2021
Figure 1 for Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components
Figure 2 for Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components
Figure 3 for Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components
Figure 4 for Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components
Viaarxiv icon

The Generalized Mean Densest Subgraph Problem

Add code
Jun 04, 2021
Figure 1 for The Generalized Mean Densest Subgraph Problem
Figure 2 for The Generalized Mean Densest Subgraph Problem
Figure 3 for The Generalized Mean Densest Subgraph Problem
Figure 4 for The Generalized Mean Densest Subgraph Problem
Viaarxiv icon

Generative hypergraph clustering: from blockmodels to modularity

Add code
Jan 27, 2021
Figure 1 for Generative hypergraph clustering: from blockmodels to modularity
Figure 2 for Generative hypergraph clustering: from blockmodels to modularity
Figure 3 for Generative hypergraph clustering: from blockmodels to modularity
Figure 4 for Generative hypergraph clustering: from blockmodels to modularity
Viaarxiv icon

Fair Clustering for Diverse and Experienced Groups

Add code
Jun 11, 2020
Figure 1 for Fair Clustering for Diverse and Experienced Groups
Figure 2 for Fair Clustering for Diverse and Experienced Groups
Figure 3 for Fair Clustering for Diverse and Experienced Groups
Figure 4 for Fair Clustering for Diverse and Experienced Groups
Viaarxiv icon

Parameterized Objectives and Algorithms for Clustering Bipartite Graphs and Hypergraphs

Add code
Feb 21, 2020
Figure 1 for Parameterized Objectives and Algorithms for Clustering Bipartite Graphs and Hypergraphs
Figure 2 for Parameterized Objectives and Algorithms for Clustering Bipartite Graphs and Hypergraphs
Figure 3 for Parameterized Objectives and Algorithms for Clustering Bipartite Graphs and Hypergraphs
Figure 4 for Parameterized Objectives and Algorithms for Clustering Bipartite Graphs and Hypergraphs
Viaarxiv icon