文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > 自然科学 > 数学 > Manhattan空间有障碍的最短路径和3_Steiner树算法
侵权投诉

Manhattan空间有障碍的最短路径和3_Steiner树算法

Manhattan空间有障碍的最短路径和3_Steiner树算法

1000-9825/2003/14(09)1503

©2003 Journal of Software 软 件 学 报 Vol.14, No.9

Manhattan空间有障碍的最短路径和3-Steiner树算法

周 智1,2, 蒋承东1,2+, 黄刘生1,2, 顾 钧3

123

(中国科学技术大学 计算机科学与技术系,安徽 合肥 230027) (国家高性能计算中心(合肥),安徽 合肥 230027) (香港科学技术大学 计算机科学系,香港)

On Optimal Rectilinear Shortest Paths and 3-Steiner Tree Routing in Presence of Obstacles

ZHOU Zhi1,2, JIANG Cheng-Dong1,2+, HUANG Liu-Sheng1,2, GU Jun3

123

(Department of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, China) (National High Performance Computing Center at Hefei, Hefei 230027, China)

(Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong, China)

+ Corresponding author: Phn: 86-551-3603747, Fax: 86-551-3601013, E-mail: cdjiang@mail.ustc.edu.cn doc.guandang.net

Received 2002-04-10; Accepted 2002-12-24

Zhou Z, Jiang CD, Huang LS, Gu J. On optimal rectilinear shortest paths and 3-steiner tree routing in presence of obstacles. Journal of Software, 2003,14(9):1503~1514. Abstract: Finding networks with minimal cost to connect points is a key problem in VLSI design, which can be described as obstacle-avoiding shortest path and minimum Steiner tree problem according to whether the number of points is greater than 2. Connection graphs, such as track based on graphs GC and GT and free area based graphs GF and GG, are effective tools for the shortest path problem, which is the foundation of the Steiner tree problem. The contribution of this paper includes three points: The dynamic algorithms for querying the shortest path between two points on each connection graph are designed and analyzed for the first time; secondly, all algorithms for Steiner problem on each connection graph are analyzed; The number of candidate Steiner points is reduced from O((e+p)2) to O((t+p)2) in the 3-Steiner algorithm on GC, where e, t, p presents the number of edges, extreme edges of obstacles and terminals; An average Θ(t) algorithm for 3-Steiner problem are designed on GG. Key words: VLSI design; connection graph; shortest path; minimal Steiner tree

摘 要: 在VLSI设计中,多点互连是物理设计阶段的关键问题之一,而互连的点数等于2或大于2分别对应于Manhattan空间上有障碍时的最短路径问题和最小Steiner树问题,显然前者是后者的基础.连接图是研究最短路径问题的有效工具,已有的典型连接图包括基于轨迹的GC和GT以及基于自由区的GF和GG.工作包括3个方面:设计  Supported by the National Grand Fundamental Research 973 Program of China under Grant No.G1998030401 (国家重点基础研究

发展规划(973))

第一作者简介: 周智(1976-),湖南娄底人,博士生,讲师,主要研究领域为复杂性理论,算法设计.

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email