Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling.
Vedangi BengaliNate VeldtPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- graph clustering
- disjoint paths
- weighted graph
- undirected graph
- np hard
- edge weights
- special case
- clustering method
- vertex cover
- worst case
- network analysis
- bipartite graph
- minimum cost
- community detection
- link prediction
- active learning
- graph partitioning
- constant factor
- shortest path
- approximation ratio
- spectral clustering
- biological networks
- unsupervised learning
- probabilistic model
- clustering algorithm
- constant factor approximation
- normalized cut
- computational complexity
- image segmentation