Minimum k-way cuts via deterministic greedy tree packing

Translated title of the contributionMinimum k-way cuts via deterministic greedy tree packing
Original languageEnglish
Title of host publicationProceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC)
Number of pages8
PublisherACM
Publication date2008
Pages159-166
Publication statusPublished - 2008
Externally publishedYes

Cite this