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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A 4.542-approximation for the Small Cuts Cover problem via a multi-rate primal-dual algorithm

Zeev Nutov, Elazar Koren
arXiv (Cornell University)
Complexity and Algorithms in Graphs
preprint

A 4.542-approximation for the Small Cuts Cover problem via a multi-rate primal-dual algorithm

Zeev Nutov, Elazar Koren
preprint en

Abstract

In the Small Cuts Cover problem we seek to cover by a min-cost edge-set the set-family of cuts of size $

arXiv (Cornell University)
Complexity and Algorithms in Graphs
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon