Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

62

ISPD
2000
ACM

favoriteEmaildiscussreport

100views Hardware» more ISPD 2000»

Provably good global routing by a new approximation algorithm for multicommodity flow

15 years 3 months ago

Provably good global routing by a new approximation algorithm for multicommodity flow

Download www.cecs.uci.edu

Christoph Albrecht

Real-time Traffic

Hardware | ISPD 2000 |

claim paper

Related Content

» Floorplan Evaluation with TimingDriven Global Wireplanning Pin Assignment and BufferWire S...

» Optimizing yield in global routing

» Provisioning a virtual private network a network design problem for multicommodity flow

» A fully polynomial time approximation scheme for timing driven minimum cost buffer inserti...

» Throughputcentric routing algorithm design

» Extending Continuous Cuts Anisotropic Metrics and Expansion Moves

» Fairness Measures for Resource Allocation

» Graph Coloring for Air Traffic Flow Management

» A flexibility aware budgeting for hierarchical flow timing closure

Post Info
More Details (n/a)

Added	01 Aug 2010
Updated	01 Aug 2010
Type	Conference
Year	2000
Where	ISPD
Authors	Christoph Albrecht

Comments (0)