Approximation algorithms for the edge-disjoint paths problem via Raecke decompositions

DOI10.1109/FOCS.2010.33MaRDI QIDQ6990320zbMATH OpenFDO

Authors Matthew Andrews

Publication date 29 April 2025

Full work available at URL https://doi.org/10.1109/FOCS.2010.33

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(1)

• O( n)-approximation algorithms for bipartiteness ratio

This page was built for publication: Approximation algorithms for the edge-disjoint paths problem via Raecke decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6990320)