Login / Signup
On the Hardness of Approximating Multicut and Sparsest-Cut.
Shuchi Chawla
Robert Krauthgamer
Ravi Kumar
Yuval Rabani
D. Sivakumar
Published in:
Computational Complexity Conference (2005)
Keyphrases
</>
computational complexity
phase transition
integrality gap
np hardness
worst case
np complete
information theoretic
learning theory
databases
real time
linear programming
rooted trees
planar graphs
randomly generated
data structure
website
machine learning
real world
data sets