Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling.
Vedangi BengaliNate VeldtPublished in: CIKM (2023)
Keyphrases
- approximation algorithms
- graph clustering
- disjoint paths
- weighted graph
- undirected graph
- np hard
- edge weights
- special case
- worst case
- vertex cover
- network analysis
- minimum cost
- clustering method
- bipartite graph
- community detection
- approximation ratio
- active learning
- shortest path
- image segmentation
- spanning tree
- link prediction
- constant factor approximation
- graph partitioning
- unsupervised learning
- clustering algorithm
- machine learning
- spectral clustering
- data objects
- image processing