Approximation algorithms for the Weighted t-Uniform Sparsest Cut and some other graph partitioning problems.
Mohammad Khairul HasanKyung-Yong ChwaPublished in: J. Comput. Syst. Sci. (2016)
Keyphrases
- approximation algorithms
- graph partitioning
- vertex cover
- np hard
- randomized algorithms
- weighted graph
- spectral graph
- normalized cut
- np complete
- worst case
- special case
- spectral clustering
- min cut
- image segmentation
- data clustering
- minimum cost
- undirected graph
- graphical models
- partitioning algorithm
- multiscale
- integrality gap