Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"Steiner Minimal Tree"”.

  1. Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction

    <p>Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction</p> <p>is becoming one of the most sought after problems in modern design</p> <p>flow. In this thesis we present an algorithm to route a</p> <p>multi-terminal net in the presence of obstacles. Ours is a top down</p> …

    iastate Repository record for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction (opens in a new tab)

  2. A Parallel Application for Tree Selection in the Steiner Minimal Tree Problem

    … that remains relevant even today, is the Steiner Minimal Tree problem. This problem is focused on finding a connected graph for a cloud of points that minimizes the overall distance of the tree. This problem has applications in fields such as telecommunications, determining where to …

    unr Repository record for A Parallel Application for Tree Selection in the Steiner Minimal Tree Problem (opens in a new tab)

  3. Ant colony optimization and rectilinear Steiner minimal trees

    … In the first part, we introduce the Rectilinear Steiner Minimal Tree (RSMT) problem and describe the Ant Colony algorithm which we use to construct the RSMT. The development of an Ant Colony algorithm called AntCol Steiner is described and we create a working program of the algorithm using the …

    ubc Repository record for Ant colony optimization and rectilinear Steiner minimal trees (opens in a new tab) Download PDF for Ant colony optimization and rectilinear Steiner minimal trees (opens in a new tab)

  4. The local Steiner problem in Minkowski spaces

    … described as the local properties of geometric Steiner minimal trees in finite-dimensional normed spaces. A Steiner minimal tree of a finite set of points is a shortest connected set interconnecting the points. For a quick introduction to this topic and an overview of all the results presented …

    qucosa-diss

  5. STEINER PROBLEM IN OCTILINEAR ROUTING MODEL

    … be solved sub-optimally by a minimum spanning tree (MST). Optimal interconnection can be obtained if the problem is formulated as the Steiner problem in which wires may meet at newly added terminals or Steiner points. The optimal interconnection is known as the Steiner minimal tree (SMT). The …

    nus Repository record for STEINER PROBLEM IN OCTILINEAR ROUTING MODEL (opens in a new tab) Download file for STEINER PROBLEM IN OCTILINEAR ROUTING MODEL (opens in a new tab)