Breaking the nk barrier for minimum k-cut on simple graphs
Name
3519935.3519948.pdf
Size
185.16 KB
Format
Adobe PDF
Checksum (MD5)
4700415fe162420c2ff7e87863d2a930
Author(s)
He, Zhiyang
Li, Jason
Date Issued
June 9, 2022
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
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution 4.0 International license
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3519935.3519948
