Network Clustering via Maximizing Modularity: Approximation Algorithms and Theoretical Limits.
Thang N. DinhXiang LiMy T. ThaiPublished in: ICDM (2015)
Keyphrases
- approximation algorithms
- network design problem
- special case
- np hard
- worst case
- vertex cover
- open shop
- facility location problem
- approximation ratio
- minimum cost
- clustering algorithm
- theoretical analysis
- np hardness
- k means
- constant factor
- wireless sensor networks
- data points
- social networks
- communication networks
- randomized algorithms
- set cover
- network design
- undirected graph
- network structure
- link prediction
- complex networks
- primal dual
- combinatorial auctions