Search Sciweavers | Sciweavers

265 search results - page 15 / 53

» Algorithms for Terminal Steiner Trees

Voted

NETWORKS
1998

49views Computer Networks» more NETWORKS 1998»

A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs

15 years 3 months ago

Download www.cs.kent.edu

Andreas Brandstädt, Feodor F. Dragan

claim paper

Read More »

101

Voted

DAC
1993
ACM

92views Computer Architecture» more DAC 1993»

A Negative Reinforcement Method for PGA Routing

15 years 7 months ago

Download www.cs.uky.edu

We present an efficient and effective method for the detailed routing of symmetrical or sea-of-gates FPGA architectures. Instead of breaking the problem into 2-terminal net collec...

Forbes D. Lewis, Wang Chia-Chi Pong

claim paper

Read More »

134

click to vote

SODA
2008
ACM

97views Algorithms» more SODA 2008»

Stochastic analyses for online combinatorial optimization problems

15 years 4 months ago

Download www.cs.cmu.edu

In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...

Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...

claim paper

Read More »

114

Voted

APPROX
2006
Springer

110views Algorithms» more APPROX 2006»

Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees

15 years 7 months ago