A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case

DOI10.1137/20M1372822arXiv2008.03327WikidataQ114074145 ScholiaQ114074145MaRDI QIDQ6346700

Sylvia Boyd, Robert Cummings, Unnamed Author, Sharat Ibrahimpur, Joseph Cheriyan, Logan Grout, Zoltán Szigeti

Publication date: 7 August 2020

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

This page was built for publication: A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case