We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...