Gives O(Δ log^{3/2} n) approximation for spanning tree congestion using a new Ω(hb(G)/Δ) lower bound based on hereditary bisection width.
Sur les assemblages de lignes.Journal f¨ ur die reine und angewandte Mathematik, 70:185–190, 1869
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Approximation of Spanning Tree Congestion using Hereditary Bisection
Gives O(Δ log^{3/2} n) approximation for spanning tree congestion using a new Ω(hb(G)/Δ) lower bound based on hereditary bisection width.