Beyond Steiner's problem: A VLSI oriented generalization
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 196-210
- https://doi.org/10.1007/3-540-52292-1_14
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Maximizing pin alignment in semi-custom chip circuit layoutIntegration, 1988
- A faster approximation algorithm for the Steiner problem in graphsInformation Processing Letters, 1988
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear ObstaclesIEEE Transactions on Computers, 1987
- On approximation algorithms for Steiner's problem in graphsPublished by Springer Nature ,1987
- A faster approximation algorithm for the Steiner problem in graphsActa Informatica, 1986
- Data Structures and Algorithms 2Published by Springer Nature ,1984
- A fast algorithm for Steiner treesActa Informatica, 1981