Shay Solomon
Abstract
A spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree is called a shallow-light tree (shortly, SLT). More specifically, an (α, β)-SLT of a weighted undirected graph G = (V, E, w) with respect to a designated vertex rt ∈ V is a spanning tree of G with:
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree is called a shallow-light tree (shortly, SLT). More specifically, an (α, β)-SLT of a weighted undirected graph G = (V, E, w) with respect to a designated vertex rt ∈ V is a spanning tree of G with:
Key concepts: Spanning tree, Shortest-path tree, Combinatorics, k-minimum spanning tree, Vertex (graph theory), Euclidean minimum spanning tree, Minimum spanning tree, Steiner tree problem