A 4.542-approximation for the Small Cuts Cover problem via a multi-rate primal-dual algorithm
In the Small Cuts Cover problem we seek to cover by a min-cost edge-set the set-family of cuts of size $
Authors
- Zeev Nutov (ORCID: https://orcid.org/0000-0002-6629-3243)
- Elazar Koren
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-17
- DOI
- https://doi.org/10.48550/arxiv.2611.22910
- Primary Topic
- Complexity and Algorithms in Graphs
- Type
- preprint