Breaking the nk barrier for minimum k-cut on simple graphs

Author(s)
He, Zhiyang; Li, Jason
Thumbnail
Download3519935.3519948.pdf (185.1Kb)
Publisher with Creative Commons License
Terms of use
Creative Commons Attribution 4.0 International license https://creativecommons.org/licenses/by/4.0/
Metadata
Show full item record
Date issued
2022-06-09
URI
https://hdl.handle.net/1721.1/146431
Department
Massachusetts Institute of Technology. Department of Mathematics
Publisher
ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
Citation
He, Zhiyang and Li, Jason. 2022. "Breaking the nk barrier for minimum k-cut on simple graphs."
Version: Final published version
ISBN
978-1-4503-9264-8
Collections

The following license files are associated with this item: