4 papers
cs.CG2026
Improved Euclidean Shallow Light Trees
Hung Le, Shay Solomon, Cuong Than +3
For parameters , a spanning tree of a weighted graph rooted at a designated vertex is called an -shallow-light tree (SLT) if (i) for every vertex ,…
cs.CG2026
Geometric -Spanners with Few Crossings
Kelvin Luu, Csaba D. Tóth
For points in the plane and an , we construct a -spanner with edges in which every edge has cros…
cs.CG2026
Bichromatic Geometric Spanners
Theodore Fung, Csaba D. Tóth
For an edge-weighted graph and a stretch parameter , a -spanner is a subgraph such that the shortest path distances in and satisfy $δ_…
cs.CG2026
Euclidean Steiner Shallow-Light Trees in Higher Dimensions
Devin Frost, Kimberly Kokado, Csaba D. Tóth
This paper proves a conjecture by Solomon about Steiner shallow-light trees (SLT) in Euclidean -space: It is shown that for any finite point set , any root, and an…