Using structured steiner trees for hierarchical global routing

DOI10.1080/00207169108803990zbMATH Open0726.68039OpenAlexW2036123903MaRDI QIDQ3348418FDOQ3348418

Authors: Massimo Ancona, E. Bruzzone, Leila De Floriani 

Publication date: 1991

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169108803990

Recommendations

• The Steiner problem in graphs: topological methods of solution
• Class Steiner trees and VLSI-design
• Publication:3210200
• A faster approximation algorithm for the Steiner problem in graphs
• A fast and simple Steiner routing heuristic

zbMATH Keywords

Steiner problemglobal routingVLSI layout

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Circuits, networks (94C99) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cites Work

• Title not available (Why is that?)
• Steiner problem in networks: A survey
• The Complexity of Computing Steiner Minimal Trees
• Problem reduction methods and a tree generation algorithm for the steiner network problem
• A fast algorithm for Steiner trees
• The steiner problem in graphs
• Steiner's problem in graphs and its implications
• The computation of nearly minimal Steiner trees in graphs
• On the Efficiency of the Algorithm for Steiner Minimal Trees
• Path Problems in Structured Graphs

This page was built for publication: Using structured steiner trees for hierarchical global routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348418)