Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154].
Jun HosodaJuraj HromkovicTaisuke IzumiHirotaka OnoMonika SteinováKoichi WadaPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- randomly generated
- random instances
- phase transition
- np complete
- topic models
- search space
- training instances
- approximation algorithms
- connected components
- data sets
- metaheuristic
- peer to peer
- np hard
- minimum cost
- spanning tree
- topic modeling
- test instances
- evolutionary algorithm
- topic specific
- np hardness
- related topics
- square error
- acyclic conjunctive queries