On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances
Jun HosodaJuraj HromkovicTaisuke IzumiHirotaka OnoMonika SteinováKoichi WadaPublished in: CoRR (2011)
Keyphrases
- phase transition
- approximation algorithms
- random instances
- np complete
- randomly generated
- computational complexity
- np hard
- worst case
- np hardness
- topic models
- minimum cost
- square error
- machine learning
- training instances
- overlay network
- spanning tree
- latent dirichlet allocation
- linear programming
- simulated annealing
- genetic algorithm