On the approximability and hardness of minimum topic connected overlay and its special instances.
Jun HosodaJuraj HromkovicTaisuke IzumiHirotaka OnoMonika SteinováKoichi WadaPublished in: Theor. Comput. Sci. (2012)
Keyphrases
- topic models
- random instances
- approximation algorithms
- training instances
- randomly generated
- phase transition
- np hard
- acyclic conjunctive queries
- np complete
- news articles
- stochastic local search
- computational complexity
- learning theory
- minimum cost
- spanning tree
- topic modeling
- overlay network
- test instances
- expert finding
- worst case
- square error
- relational database theory