265 search results - page 25 / 53 » Algorithms for Terminal Steiner Trees |
136
Voted
ICCAD
1998
IEEE
15 years 7 months ago
1998
IEEE
- This paper presents an optimal algorithm for solving the problem of simultaneous fanout optimization and routing tree construction for an ordered set of critical sinks. The algor...
120
click to vote
SODA
2010
ACM
16 years 23 days ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
128
click to vote
CDC
2009
IEEE
15 years 6 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...
109
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...
120
click to vote
AINA
2008
IEEE
15 years 10 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...