On the Hardness of Approximating Max k-Cut and its Dual.

Viggo Kann Sanjeev Khanna Jens Lagergren Alessandro Panconesi

Published in: Chic. J. Theor. Comput. Sci. (1997)

Keyphrases

phase transition
data mining
information retrieval
np hard
worst case
np complete
information theoretic
learning theory
data sets
data structure
lower bound
pairwise
probabilistic model
mutual information
hierarchical dirichlet processes