Detail publikace

Solving the Euclidean Steiner Tree Problem Using Delaunay Triangulation

ŠEDA, M.

Anglický název

Solving the Euclidean Steiner Tree Problem Using Delaunay Triangulation

Typ

Článek recenzovaný mimo WoS a Scopus

Jazyk

en

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 desired. In this paper, a modification of the Steiner insertion heuristic is presented and computational results for benchmarks from OR-Library are discussed.

Vydáno

2005-07-01

ISSN

1109-2750

Ročník

4

Číslo

6

Strany od–do

471–

Počet stran

6

BIBTEX


@article{BUT42793,
  author="Miloš {Šeda}",
  title="Solving the Euclidean Steiner Tree Problem Using Delaunay Triangulation",
  journal="WSEAS Transactions on Computers",
  year="2005",
  volume="4",
  number="6",
  pages="6",
  issn="1109-2750"
}