Solving Steiner Tree Problem Using Local Search Methods
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F99%3A00000063" target="_blank" >RIV/00216305:26210/99:00000063 - isvavai.cz</a>
Alternative codes found
RIV/00216305:26210/99:PU56157
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Solving Steiner Tree Problem Using Local Search Methods
Original language description
The Steiner tree problem (STP) on a graph involves finding a minimum cost tree which connects a designated subset of the nodes in the graph. This problem generalizes the minimum spanning tree problem and is more complicated since there are Steiner nodeswhich are not in the designated subset but may or may not be connected by the Steiner tree solution. Variants of the basic network Steiner tree model (Euclidean, rectilinear) can arise in the design of telecommunication networks where customers must be connected to a switching centre. The paper describes solution representations used in heuristic techniques for solving STP.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JD - Use of computers, robotics and its application
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
1999
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
Telecommunications and Signal processing - TST'99. 22nd International Conference
ISBN
80-214-1154-6
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
—
Publisher name
UTKO FEI VUT, EES
Place of publication
Brno, ČR
Event location
—
Event date
—
Type of event by nationality
—
UT code for WoS article
—