Minimum k-way cuts via deterministic greedy tree packing

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Standard

Minimum k-way cuts via deterministic greedy tree packing. / Thorup, Mikkel.

Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC). ACM, 2008. p. 159-166.

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Harvard

Thorup, M 2008, Minimum k-way cuts via deterministic greedy tree packing. in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC). ACM, pp. 159-166.

APA

Thorup, M. (2008). Minimum k-way cuts via deterministic greedy tree packing. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC) (pp. 159-166). ACM.

Vancouver

Thorup M. Minimum k-way cuts via deterministic greedy tree packing. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC). ACM. 2008. p. 159-166

Author

Thorup, Mikkel. / Minimum k-way cuts via deterministic greedy tree packing. Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC). ACM, 2008. pp. 159-166

Bibtex

@inproceedings{0bc231eaf6ed44c5867c0df6caace6fb,
title = "Minimum k-way cuts via deterministic greedy tree packing",
author = "Mikkel Thorup",
year = "2008",
language = "English",
pages = "159--166",
booktitle = "Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC)",
publisher = "ACM",

}

RIS

TY - GEN

T1 - Minimum k-way cuts via deterministic greedy tree packing

AU - Thorup, Mikkel

PY - 2008

Y1 - 2008

M3 - Article in proceedings

SP - 159

EP - 166

BT - Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC)

PB - ACM

ER -

ID: 98325864