An estimate of the objective function optimum for the network Steiner problem
A complete weighted graph, (Formula presented.) , is considered. Let (Formula presented.) be some subset of vertices and, by definition, a Steiner tree is any tree in the graph G such that the set of the tree vertices includes set (Formula presented.). The Steiner tree problem consists of constructi...
保存先:
主要な著者: | , , , |
---|---|
フォーマット: | 論文 |
出版事項: |
Springer New York LLC
2016
|
主題: | |
オンライン・アクセス: | http://eprints.utm.my/id/eprint/73854/ https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959108161&doi=10.1007%2fs10479-015-2068-1&partnerID=40&md5=e15420d1d346c3031b1525940dd891a0 |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
id |
my.utm.73854 |
---|---|
record_format |
eprints |
spelling |
my.utm.738542017-11-20T02:12:48Z http://eprints.utm.my/id/eprint/73854/ An estimate of the objective function optimum for the network Steiner problem Kirzhner, V. Volkovich, Z. Ravve, E. Weber, G. W. QA Mathematics A complete weighted graph, (Formula presented.) , is considered. Let (Formula presented.) be some subset of vertices and, by definition, a Steiner tree is any tree in the graph G such that the set of the tree vertices includes set (Formula presented.). The Steiner tree problem consists of constructing the minimum-length Steiner tree in graph G, for a given subset of vertices (Formula presented.) The effectively computable estimate of the minimal Steiner tree is obtained in terms of the mean value and the variance over the set of all Steiner trees. It is shown that in the space of the lengths of the graph edges, there exist some regions where the obtained estimate is better than the minimal spanning tree-based one. Springer New York LLC 2016 Article PeerReviewed Kirzhner, V. and Volkovich, Z. and Ravve, E. and Weber, G. W. (2016) An estimate of the objective function optimum for the network Steiner problem. Annals of Operations Research, 238 (1-2). pp. 315-328. ISSN 0254-5330 https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959108161&doi=10.1007%2fs10479-015-2068-1&partnerID=40&md5=e15420d1d346c3031b1525940dd891a0 |
institution |
Universiti Teknologi Malaysia |
building |
UTM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Teknologi Malaysia |
content_source |
UTM Institutional Repository |
url_provider |
http://eprints.utm.my/ |
topic |
QA Mathematics |
spellingShingle |
QA Mathematics Kirzhner, V. Volkovich, Z. Ravve, E. Weber, G. W. An estimate of the objective function optimum for the network Steiner problem |
description |
A complete weighted graph, (Formula presented.) , is considered. Let (Formula presented.) be some subset of vertices and, by definition, a Steiner tree is any tree in the graph G such that the set of the tree vertices includes set (Formula presented.). The Steiner tree problem consists of constructing the minimum-length Steiner tree in graph G, for a given subset of vertices (Formula presented.) The effectively computable estimate of the minimal Steiner tree is obtained in terms of the mean value and the variance over the set of all Steiner trees. It is shown that in the space of the lengths of the graph edges, there exist some regions where the obtained estimate is better than the minimal spanning tree-based one. |
format |
Article |
author |
Kirzhner, V. Volkovich, Z. Ravve, E. Weber, G. W. |
author_facet |
Kirzhner, V. Volkovich, Z. Ravve, E. Weber, G. W. |
author_sort |
Kirzhner, V. |
title |
An estimate of the objective function optimum for the network Steiner problem |
title_short |
An estimate of the objective function optimum for the network Steiner problem |
title_full |
An estimate of the objective function optimum for the network Steiner problem |
title_fullStr |
An estimate of the objective function optimum for the network Steiner problem |
title_full_unstemmed |
An estimate of the objective function optimum for the network Steiner problem |
title_sort |
estimate of the objective function optimum for the network steiner problem |
publisher |
Springer New York LLC |
publishDate |
2016 |
url |
http://eprints.utm.my/id/eprint/73854/ https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959108161&doi=10.1007%2fs10479-015-2068-1&partnerID=40&md5=e15420d1d346c3031b1525940dd891a0 |
_version_ |
1643656767003951104 |
score |
13.250246 |