In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
Vida Dujmovic, Michael R. Fellows, Michael T. Hall...
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...