Steiner Tree Problems and Approximation Methods for their Solution

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F01%3APU21410" target="_blank" >RIV/00216305:26210/01:PU21410 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Steiner Tree Problems and Approximation Methods for their Solution

Original language description

The aim of this paper was to describe Steiner tree problems, which are an important subset of mimimal network tasks. The only criterion that we used was total length of the network or the total costs for its creating. In spite of their broad applicationarea, Steiner problems are not studied in the Czech literature, which is evidenced by the references. Graph theory books only note these problems as a special case of the mimimum spanning tree problem or even do not mention them at all. We have tried todeal with he problems in this area in a clear way. It refers to tens of other papers often written in a very sketched form, e.g. proofs are very brief, incomplete or not quite general (e.g. the proof of NP-completeness of the RStMTP. Many theorems were formulated and proved by the author without an analogy to literature. The aim was to explain all Steiner tree problems in the same way as the foreign authors often specialize, e.g. Hwang, Warme and Zachariasen in the geometrical problems (

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BB - Applied statistics, operational research

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2001

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Habilitační a inaugurační spisy

ISSN

1213-418X

e-ISSN

—

Volume of the periodical

64

Issue of the periodical within the volume

XI

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

26

Pages from-to

1-26

UT code for WoS article

—

EID of the result in the Scopus database

—