Detail publikace
Řešení Steinerova problému s vuzižitím lokálního hledání
ŠEDA, M.
Český název
Řešení Steinerova problému s vuzižitím lokálního hledání
Anglický název
Solving Steiner Tree Problem Using Local Search Methods
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
en
Originální abstrakt
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 nodes which 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.
Anglický abstrakt
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 nodes which 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.
Klíčová slova anglicky
Spanning tree, Steiner tree, approximate algorithms, stochastic heuristic techniques
Rok RIV
1999
Vydáno
01.09.1999
Nakladatel
UTKO FEI VUT, EES
Místo
Brno, ČR
ISBN
80-214-1154-6
Kniha
Telecommunications and Signal processing - TST'99. 22nd Inte
Strany od–do
102–105
Počet stran
4
BIBTEX
@inproceedings{BUT67,
author="Miloš {Šeda},
title="Solving Steiner Tree Problem Using Local Search Methods",
booktitle="Telecommunications and Signal processing - TST'99. 22nd Inte",
year="1999",
month="September",
pages="102--105",
publisher="UTKO FEI VUT, EES",
address="Brno, ČR",
isbn="80-214-1154-6"
}