Work

The Winning Edge: A universal Θ(log n) bound for Minimum-Congestion Cycle Bases

Year: 2026

Type: article

Abstract: We establish tight Θ(logn) bounds for minimum-congestion cycle bases, introduce a minimax characterization of fractional congestion and an exact generator-matrix reformulation, and study the resulting integrality gap. We also present Nibble-H, a practical constructor that attains the certified optimum on public quantum-code instances and improves maximum edge participation over the Wang–Irani Version-3 baseline on matched larger graphs.

Source: Zenodo (CERN European Organization for Nuclear Research)

DOI: 10.5281/zenodo.21998365

Author: Ravi, Medha

Institution: California Institute of Technology

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7203677083

FWCI:

Cites:

Cited by:

Related to: