Proves existence of dimension-independent Euclidean Steiner (1+ε, O(√(1/ε)))-shallow-light trees for arbitrary finite point sets and roots in R^d.
Baratz and David Peleg , title =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Improved (O(pw), Δ)-LDD for pathwidth-pw digraphs and O(tw log n) integrality gap for directed sparsest-cut LP on treewidth-tw graphs via refined quasipartition analysis.
Deterministic Õ(n^{ω(σ)}) time algorithm for multi-source reachability in digraphs with n^σ sources, improving prior randomized n^{1+2/3ω(σ)} bound.
citing papers explorer
-
Euclidean Steiner Shallow-Light Trees in Higher Dimensions
Proves existence of dimension-independent Euclidean Steiner (1+ε, O(√(1/ε)))-shallow-light trees for arbitrary finite point sets and roots in R^d.
-
Directed Low Diameter Decomposition for Structured Digraphs
Improved (O(pw), Δ)-LDD for pathwidth-pw digraphs and O(tw log n) integrality gap for directed sparsest-cut LP on treewidth-tw graphs via refined quasipartition analysis.
-
Multi-Source Reachability in Near-Optimal Time
Deterministic Õ(n^{ω(σ)}) time algorithm for multi-source reachability in digraphs with n^σ sources, improving prior randomized n^{1+2/3ω(σ)} bound.