72 search results - page 1 / 15 » Minimum moment Steiner trees |
SODA
2004
ACM
13 years 6 months ago
2004
ACM
For a rectilinear Steiner tree T with a root, define its k-th moment Mk(T) = T (dT (u))k du, where the integration is over all edges of T, dT (u) is the length of the unique path ...
COCOA
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
COCOON
2005
Springer
13 years 11 months ago
2005
Springer
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...
ICPADS
2007
IEEE
13 years 11 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
MFCS
2001
Springer
13 years 9 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...