1671 search results - page 58 / 335 » On the Covering Steiner Problem |
119
click to vote
ENDM
2010
15 years 1 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...
WEA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
107
Voted
STACS
2009
Springer
15 years 7 months ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
100
Voted
JCO
2008
15 years 1 months ago
2008
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
158
click to vote
NETWORKS
2011
14 years 8 months ago
2011
We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival...