An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path.
Jitender S. DeogunDieter KratschGeorge SteinerPublished in: Inf. Process. Lett. (1997)
Keyphrases
- k means
- clustering method
- preprocessing
- learning algorithm
- graph structure
- graph clustering
- np hard
- computational complexity
- evolutionary algorithm
- optimal solution
- dynamic programming
- worst case
- particle swarm optimization
- expectation maximization
- objective function
- clustering algorithm
- data clustering
- approximation guarantees
- optimal path
- social networks
- greedy algorithm
- detection algorithm
- hierarchical clustering
- error bounds
- graph partitioning
- segmentation algorithm
- lower bound
- finding the shortest path