Minimum k-way cuts via deterministic greedy tree packing

Bidragets oversatte titel: Minimum k-way cuts via deterministic greedy tree packing
Bidragets oversatte titelMinimum k-way cuts via deterministic greedy tree packing
OriginalsprogEngelsk
TitelProceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC)
Antal sider8
ForlagACM
Publikationsdato2008
Sider159-166
StatusUdgivet - 2008
Udgivet eksterntJa

Citationsformater