65 search results - page 1 / 13 » On the Value of a Random Minimum Weight Steiner Tree |
COMBINATORICA
2004
13 years 6 months ago
2004
STOC
2010
ACM
13 years 11 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
COCOA
2009
Springer
14 years 25 days 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
14 years 17 days 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...