A neighborhood improvement algorithm for rectilinear Steiner trees
N Hasan, G Vijayan, CK Wong - IEEE International Symposium …, 1990 - ieeexplore.ieee.org
N Hasan, G Vijayan, CK Wong
IEEE International Symposium on Circuits and Systems, 1990•ieeexplore.ieee.orgA heuristic algorithm for constructing a rectilinear Steiner tree (RST) from a rectilinear
minimum-spanning tree of a given point set is described. The heuristic algorithm is based on
replacing neighborhood structures of an independent set of rectilinear minimum-spanning
tree points by their optimal RSTs. The time complexity of each iteration of the algorithm is O
(n log n), where n is the cardinality of the input point set.<>
minimum-spanning tree of a given point set is described. The heuristic algorithm is based on
replacing neighborhood structures of an independent set of rectilinear minimum-spanning
tree points by their optimal RSTs. The time complexity of each iteration of the algorithm is O
(n log n), where n is the cardinality of the input point set.<>
A heuristic algorithm for constructing a rectilinear Steiner tree (RST) from a rectilinear minimum-spanning tree of a given point set is described. The heuristic algorithm is based on replacing neighborhood structures of an independent set of rectilinear minimum-spanning tree points by their optimal RSTs. The time complexity of each iteration of the algorithm is O(n log n), where n is the cardinality of the input point set.< >
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果