توجه: محتویات این صفحه به صورت خودکار پردازش شده و مقاله‌های نویسندگانی با تشابه اسمی، همگی در بخش یکسان نمایش داده می‌شوند.
۱A Heuristic Algorithm for the Steiner Tree Problem in the Euclidean Plane
اطلاعات انتشار: اولین کنفرانس ملی دانش پژوهان کامپیوتر و فناوری اطلاعات، سال
تعداد صفحات: ۶
Euclidean Steiner tree problem is to find the tree with minimal Euclidean length spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set (Steiner points). The problem is NP–hard, so polynomial–time heuristics are desired. We present a novel heuristic for the Euclidean Steiner tree problem. The lgorithm utilizes the straight skeleton of simple polygon to generate candidate Steiner points, and a path heuristic to constructing Steiner minimum tree by using some of the candidate Steiner points in Euclidean plane. We present computational results on the Soukup test problems.<\div>

۲An Improved Steiner Tree Algorithm in Graph
اطلاعات انتشار: اولین کنفرانس ملی دانش پژوهان کامپیوتر و فناوری اطلاعات، سال
تعداد صفحات: ۵
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes of the original graph, which it is NP–complete. In this paper, we first review one of the existing algorithms for solving the Steiner problem in graphs, Shortest Path Heuristic algorithm, then presenting a new heuristic algorithm ISPH to improve it. We describe our algorithm and its computational results. It is shown that our algorithm can effectively improve the performance on SPH.<\div>
نمایش نتایج ۱ تا ۲ از میان ۲ نتیجه