Flows in High Degree Places: Sublinear Spanning Tree Congestion
cs.DS
Submitted: 2026-11-09
Updated: 2026-11-09
Terminology
Sources
- Two Complexity Results on Spanning-Tree Congestion Problems
- Sublinear Approximations for Spanning Tree Congestion
- Interchanging distance and capacity in probabilistic mappings
- A Sublinear Approximation Algorithm for Minimum Dilation Trees in the Plane
- Thin Trees for Near Minimum Cuts
- Parameterized Spanning Tree Congestion
- Spanning tree congestion of proper interval graphs
- Min-Max Connected Multiway Cut
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time