NDLI: New algorithms for the rectilinear Steiner tree problem

Please wait, while we are loading the content...

New algorithms for the rectilinear Steiner tree problem

Content Provider	IEEE Xplore Digital Library
Author	Ho, J.-M. Vijayan, G. Wong, C.K.
Copyright Year	1982
Abstract	An approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST), is discussed. The main idea in this approach is to find layouts for the edges of the MST that maximize the overlaps between the layouts, thus minimizing the cost (i.e. wire length) of the resulting rectilinear Steiner tree. Two algorithms for constructing rectilinear Steiner trees from MSTs, which are optimal under the conditions that the layout of each edge of the MST is an L shape or any staircase, respectively, are described. The first algorithm has linear time complexity and the second algorithm has a higher polynomial time complexity. Steiner trees produced by the second algorithm have a property called stability, which allows the rerouting of any segment of the tree, while maintaining the cost of the tree, and without causing overlaps with the rest of the tree. Stability is a desirable property in VLSI global routing applications.<>
Sponsorship	IEEE Council on Electronic Design Automation IEEE Circuits and Systems Society
Starting Page	185
Ending Page	193
Page Count	9
File Size	1023702
File Format	PDF
ISSN	02780070
Volume Number	9
Issue Number	2
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1990-02-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Costs Wire Polynomials Very large scale integration Stability Routing Heuristic algorithms Ear Information science Shape
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Electrical and Electronic Engineering Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Distributed Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem

Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm

Multilayer chip-level global routing using an efficient graph-based Steiner tree heuristic

Efficient Steiner tree construction based on spanning graphs

New approximation algorithms for routing with multiport terminals

Spanning graph-based nonrectilinear steiner tree algorithms

A new heuristic for rectilinear Steiner trees

Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

New algorithms for the rectilinear Steiner tree problem

Similar Documents

A Distributed Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem

Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm

Multilayer chip-level global routing using an efficient graph-based Steiner tree heuristic

Efficient Steiner tree construction based on spanning graphs

New approximation algorithms for routing with multiport terminals

Spanning graph-based nonrectilinear steiner tree algorithms

A new heuristic for rectilinear Steiner trees

Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

New algorithms for the rectilinear Steiner tree problem