Network Clustering via Maximizing Modularity: Approximation Algorithms and Theoretical Limits.
Thang N. DinhXiang LiMy T. ThaiPublished in: CoRR (2016)
Keyphrases
- approximation algorithms
- network design problem
- np hard
- special case
- vertex cover
- minimum cost
- worst case
- clustering algorithm
- facility location problem
- k means
- network structure
- set cover
- disjoint paths
- genetic algorithm
- randomized algorithms
- approximation ratio
- spanning tree
- complex networks
- network flow
- theoretical analysis
- undirected graph
- link prediction
- np hardness
- metaheuristic
- constant factor
- upper bound
- wireless sensor networks
- open shop
- lower bound