Reference Work Entry

Encyclopedia of Algorithms

pp 2032-2035


Spanning Trees with Low Average Stretch

  • Ittai AbrahamAffiliated withMicrosoft Research Email author 
  • , Ofer NeimanAffiliated withDepartment of Computer Science, Ben-Gurion University of the Negev


Embedding Spanning tree Stretch

Years and Authors of Summarized Original Work

  • 2012; Abraham, Neiman

Problem Definition

Let G = (V, E) be an undirected graph, with nonnegative weights on the edges \(w : E \rightarrow \mathbb{R}_{+}\). Let dG be the shortest-path metric on G, with respect to the weights. For a spanning (subgraph) tree T of G, define the stretch of an edge {u, v} ∈ E in T as ...

This is an excerpt from the content