Heuristics for Steiner Tree Problem in the Euclidean Plane
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F00%3A00000124" target="_blank" >RIV/00216305:26210/00:00000124 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Heuristics for Steiner Tree Problem in the Euclidean Plane
Original language description
The goal of the Euclidean Steiner Tree Problem is to find a shortest network spanning n points in the plane. It is known that the solution to this problem, the Steiner minimum tree, is a minimum spanning tree on given points and on a set of additional vertices introduced into the Euclidean plane in order to achieve a minimal solution. The problem is known to be NP-complete and therefore for large scale instances it can be solved only by approximation or heuristic techniques. The paper presents the mainapproaches and discusses their effectiveness.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2000
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
XXIInd International Colloquium Advanced Simulation of Systems ASIS 2000
ISBN
80-85988-51-8
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
—
Publisher name
MARQ Ostrava
Place of publication
Sv. Hostýn - Bystřice pod Hostýnem (Czec
Event location
—
Event date
—
Type of event by nationality
—
UT code for WoS article
—