Detail publikace

An Improved Insertion Heuristic for the Euclidean Minimum Steiner Tree Problem

ŠEDA, M.

Originální název

An Improved Insertion Heuristic for the Euclidean Minimum Steiner Tree Problem

Typ

kapitola v knize

Jazyk

angličtina

Originální abstrakt

The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem being NP-hard, polynomial-time approximations or heuristics are required. There are many rather complex heuristics based, e.g., on enumerating full topologies and consuming long time for computations for large instances. In this paper, we applied to use tools of computational geometry, especially the properties of Delaunay triangulation, a well-known geometric structure, and combine them with insertion heuristics based on the construction of the Euclidean minimum spanning tree. Thus an algorithm could be proposed that is very efficient and fast. Experiments confirmed that computations by this algorithm generate very good results in a reasonable amount of time, even for large instances of the studied problem.

Klíčová slova

Steiner tree, spanning tree, Delaunay triangulation, time complexity, NP-hard problems

Autoři

ŠEDA, M.

Rok RIV

2007

Vydáno

31. 12. 2007

Nakladatel

DAAAM International

Místo

Wien (Austria)

ISBN

3-901509-60-7

Kniha

Katalinic, B. (ed.): DAAAM International Scientific Book 2007

Edice

DAAAM International Scientific Book

Číslo edice

1

Strany od

501

Strany do

512

Strany počet

12

BibTex

@inbook{BUT55432,
  author="Miloš {Šeda}",
  title="An Improved Insertion Heuristic for the Euclidean Minimum Steiner Tree Problem",
  booktitle="Katalinic, B. (ed.): DAAAM International Scientific Book 2007",
  year="2007",
  publisher="DAAAM International",
  address="Wien (Austria)",
  series="DAAAM International Scientific Book",
  edition="1",
  pages="501--512",
  isbn="3-901509-60-7"
}