Author:
Fößmeier U.,Kaufmann M.,Zelikovsky A.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bounding the expected number of rectilinear full Steiner trees;Networks;2009-08-11
2. The Number of Tree Stars Is O
*(1.357
k
);Algorithmica;2007-09-14
3. Spanning graph-based nonrectilinear steiner tree algorithms;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2005-07
4. A new heuristic for rectilinear Steiner trees;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2000
5. Efficient octilinear steiner tree construction based on spanning graphs;ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)