On the hardness and approximation of minimum topic-connected overlay.
Monika SteinováPublished in: PODC (2011)
Keyphrases
- approximation algorithms
- neural network
- topic models
- minimum cost
- learning theory
- error tolerance
- approximation schemes
- constant factor
- approximation ratio
- polygonal approximation
- continuous functions
- approximation error
- latent dirichlet allocation
- connected components
- closed form
- information theoretic
- worst case
- social media
- np hard
- digital libraries
- computational complexity
- error bounds
- approximation methods
- np hardness
- information retrieval