Additive Approximation Algorithms for Modularity Maximization.
Yasushi KawaseTomomi MatsuiAtsushi MiyauchiPublished in: ISAAC (2016)
Keyphrases
- approximation algorithms
- constant factor approximation
- np hard
- special case
- worst case
- vertex cover
- open shop
- minimum cost
- undirected graph
- randomized algorithms
- network design problem
- np hardness
- set cover
- objective function
- constant factor
- facility location problem
- primal dual
- approximation ratio
- polynomial time approximation
- combinatorial auctions
- approximation guarantees
- exact algorithms
- scheduling problem