Location:
Search - Steiner
Search list
Description: steiner树的具体描述，用vc++编写，是个好东西
-STEINER specific description of the tree, with vc prepared is a good thing
Platform: |
Size: 713458 |
Author: lin |
Hits:
Description: 很少的steiner算法，大家可以一起来研究一下-little STEINER algorithm, we can look at one up
Platform: |
Size: 1973303 |
Author: lin |
Hits:
Description: 生成直角Steiner树的程序包-generated rectangular Steiner tree package
Platform: |
Size: 1973248 |
Author: 胡周 |
Hits:
Description: steiner树的具体描述，用vc++编写，是个好东西
-STEINER specific description of the tree, with vc prepared is a good thing
Platform: |
Size: 712704 |
Author: lin |
Hits:
Description: 很少的steiner算法，大家可以一起来研究一下-little STEINER algorithm, we can look at one up
Platform: |
Size: 1973248 |
Author: lin |
Hits:
Description: 关于steiner算法的介绍，希望大家关注一下-on STEINER algorithm, we hope that the concern about
Platform: |
Size: 86016 |
Author: linbing |
Hits:
Description: 关于组播问题的介绍，中间有steiner介绍-Multicast on the issue, briefed middle STEINER
Platform: |
Size: 253952 |
Author: linbing |
Hits:
Description: 关于steiner介绍，中间有ps格式，可以把其转为pdf格式-on STEINER, middle ps format can be converted to look at the pdf format
Platform: |
Size: 182272 |
Author: linbing |
Hits:
Description: steiner树的文章和实现,这个东西写的很详细 在图论中很有用处-Steiner tree of the articles and realized this thing written in great detail in graph theory is very useful
Platform: |
Size: 2001920 |
Author: 27077 |
Hits:
Description: steiner tree工具，利用率挺高的，计算minial steiner tree时候可以看看 -steiner tree tools, utilization of挺高calculated when minial steiner tree can look at
Platform: |
Size: 136192 |
Author: wy |
Hits:
Description: A classic Steiner tree constructor based on branch-and-bound with the most close-to-optimum solution quality
Platform: |
Size: 530432 |
Author: Ernesto Liu |
Hits:
Description: BOI version of Steiner tree construction, practical and popular for manhattan VLSI routing, generate a Steiner minimum tree for given set of terminals in a layout plane-BOI version of Steiner tree construction, practical and popular for manhattan VLSI routing, generate a Steiner minimum tree for given set of terminals in a layout plane
Platform: |
Size: 365568 |
Author: Ernesto Liu |
Hits:
Description: PTree: Find the optimum Steiner tree for a given terminal sequence. Linear runtime complexity. Optimum solution.
Platform: |
Size: 140288 |
Author: Ernesto Liu |
Hits:
Description: Notebooks of the Mind - Explorations of Thinking(John-Steiner).论文写作的经典教程，为不会写文章的同学补补课。-Notebooks of the Mind- Explorations of Thinking (John-Steiner). Thesis writing classic tutorial will not write articles for the students fill up classes.
Platform: |
Size: 11582464 |
Author: chengtong |
Hits:
Description: Rectilinear Steiner tree is a graph constructed by line segments along the horizontally and vertically directions
Platform: |
Size: 676864 |
Author: dds |
Hits:
Description: 遗传算法在Steiner树中的应用
遗传算法的相关论文-In order tO solve the subject of Steiner minimum spanning tree，an adaptive genetic algorithm is introduced．The Steiner
minimum spanning tree is transformed into a combination-optimization problem and a triabselection method is proposed for the crea·
tion of the partial
Platform: |
Size: 35840 |
Author: 利用 |
Hits:
Description: Steiner Genetic Algorithm.
Genetic Algorithm used to search for maximum/minimum value of a given function using the concept of chromes and genes.
Platform: |
Size: 8192 |
Author: Aseng Zing |
Hits:
Description: 在 VLSI 设计中,多点互连是物理设计阶段的关键问题之一,而互连的点数等于 2 或大于 2 分别对应于
Manhattan 空间上有障碍时的最短路径问题和最小 Steiner 树问题,显然前者是后者的基础.连接图是研究最短路径
问题的有效工具,已有的典型连接图包括基于轨迹的GC 和GT 以及基于自由区的GF 和GG.工作包括3个方面:设计并分析了在各种连接图上实现动态的点对之间的最短路径查询算法 分析了在各个连接图上构造 3-Steiner 树的算
法,对于已有的 GC 上的 3-Steiner 算法,将其 Steiner 顶点的候选集合规模从 O((e+p)
2
)降低到了 O((t+p)
2
),其中 e,t,p
分别表示边数、障碍极边数和顶点数 设计了在GG上的3-Steiner树构造算法,其平均情况时间复杂度只有Θ(t). -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
Platform: |
Size: 595968 |
Author: 东方雨 |
Hits:
Description: 详细介绍了基于最短路径的施泰纳树问题,还有一篇是基于最小生成树的施泰纳树问题-Details of the Steiner tree problem based on the shortest path, there is a minimum spanning tree based Steiner tree problem
Platform: |
Size: 1024 |
Author: Lavender |
Hits:
Description: xiangx详细介绍了基于最小生成树的施泰纳树问题，还有一种方法是介绍基于最短路径的施泰纳树-xiangx detailing the minimum spanning tree based Steiner tree problem, there is a way to introduce the shortest path based Steiner tree
Platform: |
Size: 1024 |
Author: Lavender |
Hits: