arXiv · 2611.22910
A 4.542-approximation for the Small Cuts Cover problem via a multi-rate primal-dual algorithm
Abstract
In the Small Cuts Cover problem we seek to cover by a min-cost edge-set the set-family of cuts of size $<k$ of a graph. Bansal, Cheriyan, Grout, and Ibrahimpur [ICALP 2023: 15:1-15:19] showed that the classic primal-dual algorithm with reverse delete of Williamson, Goemans, Mihail, and Vazirani [STOC 1993: 708-717] achieves approximation ratio $16$ for this problem. The analysis of the approximation ratio was then improved in a sequence of papers, culminating in the $5$-approximation by Simons, Bansal, and Cheriyan. A matching example of Nutov shows that this bound is tight for the classic algorithm. We improve the approximation ratio to $(3+\sqrt{37})/2<4.542$ using a multi-rate primal-dual algorithm (that applies for strongly pliable set-families) in which the dual variables of the inclusion-minimal violated sets are not raised uniformly, but with different rates. We also provide a tight example. To the best of our knowledge, this is the first example in network design where for the standard LP, an efficiently computable choice of growth rates improves on the tight guarantee of uniform growth.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Zeev Nutov, Elazar Koren. 2026-11-17. A 4.542-approximation for the Small Cuts Cover problem via a multi-rate primal-dual algorithm. https://searcharxiv.com/abs/2611.22910
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.