An O(nlogn) edge-based algorithm for obstacle-avoiding rectilinear steiner tree construction

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Jieyi Long Northwestern University, Evanston, IL, USA
Hai Zhou Northwestern University, Evanston, IL, USA
Seda Ogrenci Memik Northwestern University, Evanston, IL, USA
Published in:
Cover Image
 
· Proceeding
ISPD '08 Proceedings of the 2008 international symposium on Physical design
Pages 126-133
ACM New York, NY, USA ©2008
table of contents ISBN: 978-1-60558-048-7 doi>10.1145/1353629.1353658
An <i>O</i>(<i>n</i>log<i>n</i>) edge-based algorithm for obstacle-avoiding rectilinear steiner tree construction Published by ACM 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 22
· Downloads (cumulative): 250
· Citation Count: 4


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