A 4.542-approximation for the Small Cuts Cover problem via a multi-rate primal-dual algorithm
Year: 2026
Type: preprint
Abstract: In the Small Cuts Cover problem we seek to cover by a min-cost edge-set the set-family of cuts of size $
Source: arXiv (Cornell University)
Authors: Nutov, Zeev, Koren, Elazar
Institution: Open University of Israel
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: approximation algorithms, approximation ratio
Open Access status: green
OpenAlex ID: W7235944846
