Searching for "On the Hardness of Approximating Multicut and Sparsest-Cut." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

On the Hardness of Approximating Multicut and Sparsest-Cut
by Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar — 2005 — In Proceedings of the 20th Annual IEEE Conference on Computational Complexity
…On the Hardness of Approximating Multicut and Sparsest-Cut [Extended Abstract] Shuchi Chawla…
Cited by 36 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB