A faster dynamic programming algorithm for exact rectilinear Steiner minimal trees

Proceedings of 4th Great Lakes Symposium on VLSI Pub Date : 1994-03-04 DOI:10.1109/GLSV.1994.289962

J. L. Ganley, J. Cohoon

引用次数: 22

Abstract

An exact rectilinear Steiner minimal tree algorithm is presented that improves upon the time and space complexity of previous guarantees and is easy to implement. Experimental evidence is presented that demonstrates that the algorithm also works well in practice.<>

查看原文本刊更多论文

精确线性斯坦纳最小树的快速动态规划算法

提出了一种精确的线性斯坦纳最小树算法，该算法改进了以往保证的时间和空间复杂度，易于实现。实验结果表明，该算法在实际应用中效果良好。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of 4th Great Lakes Symposium on VLSI

自引率

0.00%

发文量