Exact Algorithms for Plane Steiner Tree Problems: A Computational Study
Author:
Publisher
Springer US
Link
http://link.springer.com/content/pdf/10.1007/978-1-4757-3171-2_6
Reference27 articles.
1. J. E. Beasley. OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society, 41:1069–1072,1990.
2. M. W. Bern and R. L. Graham. The Shortest-Network Problem. Scientific American, pages 66–71, January 1989.
3. M. Brazil, T. Cole, J. H. Rubinstein, D. A. Thomas, J. F. Weng, and N. C. Wormald. Minimal Steiner Trees for 2k x 2k Square Lattices. Journal of Combinatorial Theory, Series A, 73:91–110, 1996.
4. M. Brazil, J. H. Rubinstein, D. A. Thomas, J. F. Weng, and N. C. Wormald. Full Minimal Steiner Trees on Lattice Sets. Journal of Combinatorial Theory, Series A, 78:51–91, 1997.
5. M. Brazil, J. H. Rubinstein, D. A. Thomas, J. F. Weng, and N. C. Wormald. Minimal Steiner Trees for Rectangular Arrays of Lattice Points. Journal of Combinatorial Theory, Series A, 79:181–208, 1997.
Cited by 62 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Net Topology Exploration and Tuning for Mitigating Congestion in Global Routing;2024 IEEE International Symposium on Circuits and Systems (ISCAS);2024-05-19
2. Heuristic optimal transport in branching networks;International Journal of Modern Physics C;2024-03-12
3. Towards Timing-Driven Routing: An Efficient Learning Based Geometric Approach;2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD);2023-10-28
4. A Very Large-Scale Integration Global Routing Optimization Model for Hybrid Physarum Bionetworks;Research Journal of Engineering and Technology;2023-06-30
5. A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$;International Transactions in Operational Research;2023-02-18
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3