Buffered Steiner trees for difficult instances

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: C. J. Alpert IBM Corp., Austin, TX
Miloš Hrkić University of Illinois at Chicago, EECS Dept., Chicago, IL
J. Hu IBM Corp., Austin, TX
A. B. Kahng University of California at San Diego, CS Dept., San Diego, CA
J. Lillis University of Illinois at Chicago, EECS Dept., Chicago, IL
B. Liu University of California at San Diego, CS Dept., San Diego, CA
S. T. Quay IBM Corp., Austin, TX
S. S. Sapatnekar University of Minnesota, ECE Dept.
A. J. Sullivan IBM Corp., Austin, TX
P. Villarrubia IBM Corp., Austin, TX
Buffered Steiner trees for difficult instances Published by ACM 2001 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 15
· Downloads (cumulative): 430
· Citation Count: 12

Published in:
Cover Image
 
· Proceeding
ISPD '01 Proceedings of the 2001 international symposium on Physical design
Pages 4-9
ACM New York, NY, USA ©2001
table of contents ISBN:1-58113-347-2 doi>10.1145/369691.369699

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder