A Polynomial Time Approximation Scheme for Rectlinear Steiner Mininum Tree Construction in the Presence of Obstacles

Liu, Jian
Zhao, Ying
2002-04-18
Thumbnail Image

View/Download File

02-015.pdf (227.14 KB)

Persistent link to this item

https://hdl.handle.net/11299/215519
Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

A Polynomial Time Approximation Scheme for Rectlinear Steiner Mininum Tree Construction in the Presence of Obstacles

Alternative title

Authors

Published Date

2002-04-18

Publisher

Type

Report

Abstract

One problem in VLSI physical designs is to route multi-terminal nets in the presence of obstacles. This paper presents a polynomial time approximation scheme for construction of a rectilinear minimum tree in the presence of obstacles. Given any m rectanglar obstacles, n nodes andepislon>0, the scheme find a (1+epislon)-approximation to the optimum solution in time of n^(O(1/epsilon)), providing an alternative of previous heuristics.Key words:Rectilinear Steiner Minimum Tree in presence of obstacles, VLSI routing, PTAS, Guillitone cut, approximation algorithm.

Keywords

Description

Related to

Replaces

License

Collections

Computer Science & Engineering (CS&E) Technical Reports

Series/Report Number

Technical Report; 02-015

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Other identifiers

Suggested citation

Liu, Jian; Zhao, Ying. (2002). A Polynomial Time Approximation Scheme for Rectlinear Steiner Mininum Tree Construction in the Presence of Obstacles. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215519.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.