6 papers
Improved Euclidean Shallow Light Trees
Hung Le, Shay Solomon, Cuong Than +2
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 ,…
Geometric -Spanners with Few Crossings
Kelvin Luu, Csaba D. Tóth
For points in the plane and , we construct a -spanner with edges in which every edge has crossin…
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 $δ_H…
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…
Minimum Plane Bichromatic Spanning Trees
Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine +3
For a set of red and blue points in the plane, a minimum bichromatic spanning tree (MinBST) is a shortest spanning tree of the points such that every edge has a red and a blue endp…
Towards Instance-Optimal Euclidean Spanners
Hung Le, Shay Solomon, Cuong Than +2
Euclidean spanners are important geometric objects that have been extensively studied since the 1980s. The two most basic "compactness'' measures of a Euclidean spanner are the…