105 search results - page 12 / 21 » A 3-Approximation for the Minimum Tree Spanning k Vertices |
STACS
2007
Springer
14 years 1 months ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
JCO
2007
13 years 7 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
ESA
1994
Springer
13 years 11 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
JCSS
2010
13 years 6 months ago
2010
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero ar...
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...