English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Near-Linear Time Approximations for Cut Problems via Fair Cuts

MPS-Authors
/persons/resource/persons45102

Nanongkai,  Danupon       
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://epubs.siam.org/doi/reader/10.1137/1.9781611977554.ch10
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Li, J., Nanongkai, D., Panigrahi, D., & Saranurak, T. (2023). Near-Linear Time Approximations for Cut Problems via Fair Cuts. In N. Bansal, & V. Nagarajan (Eds.), Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 240-257). Philadelphia, PA: SIAM. doi:10.1137/1.9781611977554.ch10.


Cite as: https://hdl.handle.net/21.11116/0000-000C-9381-B
Abstract
There is no abstract available