Sciweavers

265 search results - page 15 / 53
» Algorithms for Terminal Steiner Trees
Sort
View
DAC
1993
ACM
13 years 11 months ago
A Negative Reinforcement Method for PGA Routing
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
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
13 years 8 months ago
Stochastic analyses for online combinatorial optimization problems
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...
APPROX
2006
Springer
110views Algorithms» more  APPROX 2006»
13 years 11 months ago
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad ...