An Approximation for the 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%2F03%3APU40461" target="_blank" >RIV/00216305:26210/03:PU40461 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
An Approximation for the Steiner Tree Problem in the Euclidean Plane
Original language description
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 is NP-hard, so 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.
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
2003
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
Proceedings of the 7th International Research/Expert Conference Trends in the Development of Machinery and Associated Technology TMT 2003
ISBN
9958-617-18-8
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
1101-1104
Publisher name
Universitat Politecnica de Catalunya
Place of publication
Barcelona (Spain)
Event location
Lloret de Mar
Event date
Sep 14, 2003
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—