A class of bounded approximation algorithms for graph partitioning.
Thomas A. FeoMallek KhellafPublished in: Networks (1990)
Keyphrases
- approximation algorithms
- graph partitioning
- np hard
- special case
- partitioning algorithm
- minimum cost
- worst case
- vertex cover
- weighted graph
- image segmentation
- graph model
- approximation ratio
- primal dual
- computer vision
- spectral clustering
- constant factor
- clustering algorithm
- undirected graph
- supervised learning
- linear programming
- data clustering
- multi class
- object classes
- bayesian networks