Approximation of spanning tree congestion using hereditary bisection

DOI10.4230/LIPICS.STACS.2025.63MaRDI QIDQ7287802zbMATH OpenFDO

Authors Petr Kolman

Publication date 24 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2025.63

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A Survey on Spanning Tree Congestion
• About groups of straight lines
• Approximating spanning tree congestion on graphs with polylog degree
• Better hardness results for the minimum spanning tree congestion problem
• Crossing number, pair-crossing number, and expansion
• Excluded minors, network decomposition, and multicommodity flow
• Expander flows, geometric embeddings and graph partitioning
• Spanning tree congestion and computation of generalized Győri-Lovász partition

Cited in

(2)

• Parameterized spanning tree congestion
• Approximation of spanning tree congestion using hereditary bisection

This page was built for publication: Approximation of spanning tree congestion using hereditary bisection

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