Constant-factor approximation algorithms for identifying dynamic communities.

Chayant Tantipathananandh Tanya Y. Berger-Wolf

Published in: KDD (2009)

Keyphrases

approximation algorithms
constant factor
np hard
special case
vertex cover
worst case
primal dual
minimum cost
randomized algorithms
lower bound
approximation ratio
polynomial time approximation
upper bound
objective function
computational complexity
constant factor approximation