Klein, Serge A

Philip N · 1993 · arXiv 7088.167261

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it

representative citing papers

cs.DS · 2026-05-18 · unverdicted · novelty 8.0

A 1-PLS of cost p implies a t-PLS of cost O(ceil(p/t)) up to log n factors in general graphs and O(ceil(p/t) + log n) in fixed minor-free graphs.

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 2 of 2 citing papers.

Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes cs.DS · 2026-05-18 · unverdicted · none · ref 1
A 1-PLS of cost p implies a t-PLS of cost O(ceil(p/t)) up to log n factors in general graphs and O(ceil(p/t) + log n) in fixed minor-free graphs.
Approximation of Spanning Tree Congestion using Hereditary Bisection cs.DS · 2024-10-01 · unverdicted · none · ref 4
Gives O(Δ log^{3/2} n) approximation for spanning tree congestion using a new Ω(hb(G)/Δ) lower bound based on hereditary bisection width.