期刊文献+

求解最小Steiner树的可视化试验方法 被引量:3

A visualization approach for the Steiner minimal tree problem
原文传递
导出
摘要 求解最小Steiner树是NP难题,在通信网络设计、交通规划等工程实际中有着广泛的应用.利用表面活性剂溶液的物化特性,将溶液的最小表面张力特性采用平行板结构转化成二维平面的最优路径,得到了最小Steiner树的可视化解.通过改变模板装置和溶液的相对运动,研发出了最短路径可视化仪,为将最小Steiner树求解应用于工程实践探索了新的方法手段. The Steiner minimal tree problem shows the availability in many engineering practices such as communication network, arterial traffic programming, notwithstanding one of the NP problems. A visualization approach is proposed in this paper by using the physical chemistry characteristics of the surfactant solution and developed experiment unit. The minimum surface tension of the surfactant solution can be transformed into twodimensional system shortest path planning, and a transparency visualization scheme, i.e. a Steiner minimum tree, for objective can be formed steadily and rapidly. A special visualization instrument for system shortest path programming is developed by changing the relative movement of the template unit and the surfactant solution, and shown a new application approach for the Steiner minimal tree problem to engineering applications.
出处 《系统工程理论与实践》 EI CSCD 北大核心 2008年第7期173-178,共6页 Systems Engineering-Theory & Practice
基金 国家自然科学基金(70671035)
关键词 最小Steiner树 表面活性剂溶液 最短路径规划 可视化仪 Steiner minimum tree surfactant solution shortest path programming visualization instrument
  • 相关文献

参考文献12

二级参考文献50

  • 1金慧敏,马良.遗传退火进化算法在背包问题中的应用[J].上海理工大学学报,2004,26(6):561-564. 被引量:37
  • 2Carden R C IV, Li J M, Cheng C K. A global router with a theoretical bound on the optimal solution. IEEE Trans .Computer-Aided Design, Feb. 1996,15: 208-216. 被引量:1
  • 3Jing T, Hong X L, Bao H Y, Xu J Y, Gu J. SSTT: Efficient local search for GSI global routing. J. Computer Science and Technology, 2003, 18(5): 632-639. 被引量:1
  • 4Jing T, Hong XL, Xu J Y, Bao H Y, Cheng C K, Gu J. UTACO: A unified timing and congestion optimization algorithm for standard cell global routing. IEEE Trans. CAD,2004, 23(3): 358-365. 被引量:1
  • 5Xiang H, Tang X P, Wong D F. An algorithm for integrated pin assignment and buffer planning. In Proc. ACM/IEEE Design Automation Conf. ( DAC), 2002, pp.584-589. 被引量:1
  • 6Hong X L, Jing T, Xu J Y, Bao H Y, Gu J. CNB: A criticalnetwork-based timing optimization method for standard cell global routing. J. Computer Science and Technology, 2003,18(6): 732-738. 被引量:1
  • 7Xu J Y, Hong X L, Jing T, Cai Y C, Gu J. A novel timingdriven global routing algorithm considering coupling effects for high performance circuit design. IEICE Trans. Fundamentals of EGGS, 2003, E86-A(12): 3158-3167. 被引量:1
  • 8Wang Y, Hong X L, Jing T, Yang Y, Hu X D, Yan G Y. An efficient low-degree RMST algorithm for VLSI/ULSI physical design. Lecture Notes in Computer Science (LNCS)3254 - Integrated Circuits and System Design, Santorini, Greece, Sept.2004, pp.442-452. 被引量:1
  • 9Xu J Y, Hong X L, Jing T, Cai Y C, Gu J. An efficient hierarchical timing-driven Steiner tree algorithm for global routing, INTEGRATION, VLSI J., 2003, 35(2): 69-84. 被引量:1
  • 10Garey M R, Johnson D S. The rectilinear Steiner tree problem is NP-complete. SIAM Journal on Applied Mathematics,1977, 32:826-834. 被引量:1

共引文献51

同被引文献21

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部