Approximation of Spanning Tree Congestion Using Hereditary Bisec- tion

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

cs.DS · 2024-10-01 · unverdicted · novelty 6.0

Gives O(Δ log^{3/2} n) approximation for spanning tree congestion using a new Ω(hb(G)/Δ) lower bound based on hereditary bisection width.

Showing 1 of 1 citing paper.

Approximation of Spanning Tree Congestion using Hereditary Bisection cs.DS · 2024-10-01 · unverdicted · none · ref 6
Gives O(Δ log^{3/2} n) approximation for spanning tree congestion using a new Ω(hb(G)/Δ) lower bound based on hereditary bisection width.