3 papers
cs.CG2026
Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity
Sujoy Bhore, Sándor Kisfaludi-Bak, Lazar Milenković +3
A Euclidean noncrossing Steiner -spanner for a point set is a planar straight-line graph that, for any two points , contains a path whose…
cs.DS2025
Tree-Like Shortcuttings of Trees
Hung Le, Lazar Milenković, Shay Solomon +1
Sparse shortcuttings of trees -- equivalently, sparse 1-spanners for tree metrics with bounded hop-diameter -- have been studied extensively (under different names and settings), s…
cs.CG2025
Covering the Euclidean Plane by a Pair of Trees
Hung Le, Lazar Milenković, Shay Solomon +1
A {-stretch tree cover} of a metric space , for a parameter , is a collection of trees such that every pair of points has a -stretch path in one of the tr…