411 search results - page 18 / 83 » A New Approach to the Rectilinear Steiner Tree Problem |
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
CPM
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Phylogenetics is a science of determining connections between groups of organisms in terms of ancestor/descendent relationships, usually expressed by phylogenetic trees, ...
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...
DAC
2003
ACM
15 years 10 months ago
2003
ACM
In this paper, we present a new method to improve global routing results. By using an amplified congestion estimate to influence a rip-up and reroute approach, we obtain substanti...
100
click to vote
LION
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...