Additive approximation algorithms for modularity maximization.
Yasushi KawaseTomomi MatsuiAtsushi MiyauchiPublished in: J. Comput. Syst. Sci. (2021)
Keyphrases
- approximation algorithms
- constant factor approximation
- np hard
- special case
- worst case
- vertex cover
- facility location problem
- minimum cost
- approximation ratio
- network design problem
- set cover
- exact algorithms
- objective function
- primal dual
- randomized algorithms
- approximation schemes
- open shop
- np hardness
- precedence constraints
- polynomial time approximation
- upper bound
- disjoint paths
- partial order