632 search results - page 36 / 127 » On the Approximability of the Steiner Tree Problem |
CDC
2009
IEEE
15 years 3 months ago
2009
IEEE
Abstract— The paper investigates theoretical issues in applying the universal swarming technique to efficient content distribution. In a swarming session, a file is distributed...
105
click to vote
ISAAC
1998
Springer
15 years 4 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. A designated fusion center performs an opti...
101
click to vote
INFOCOM
1995
IEEE
15 years 3 months ago
1995
IEEE
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In thi...
112
Voted
ENDM
2010
14 years 12 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...