666 search results - page 25 / 134 » New primal-dual algorithms for Steiner tree problems |
JCO
2008
13 years 10 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...
LATIN
1995
Springer
14 years 1 months ago
1995
Springer
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...
MOR
2007
13 years 9 months ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
AINA
2008
IEEE
14 years 4 months ago
2008
IEEE
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...