A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Spanning Tree Congestion and Computation of Generalized Győri-Lovász Partition
[article]
2018
arXiv
pre-print
We study a natural problem in graph sparsification, the Spanning Tree Congestion () problem. Informally, the problem seeks a spanning tree with no tree-edge routing too many of the original edges. The root of this problem dates back to at least 30 years ago, motivated by applications in network design, parallel computing and circuit design. Variants of the problem have also seen algorithmic applications as a preprocessing step of several important graph algorithms. For any general connected
arXiv:1802.07632v2
fatcat:tlexezq525ajtmbmglhkqou5wu