265 search results - page 5 / 53 » Algorithms for Terminal Steiner Trees |
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
COCOA
2009
Springer
14 years 1 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...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
ALGORITHMICA
2005
13 years 7 months ago
2005
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...