Steiner Tree Problems and Approximation Methods for their Solution

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Steiner Tree Problems and Approximation Methods for their Solution

Popis výsledku v původním jazyce

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 (

Název v anglickém jazyce

Steiner Tree Problems and Approximation Methods for their Solution

Popis výsledku anglicky

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 (

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2001

Kód důvěrnosti údajů

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

Název periodika

Habilitační a inaugurační spisy

ISSN

1213-418X

e-ISSN

—

Svazek periodika

64

Číslo periodika v rámci svazku

XI

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

26

Strana od-do

1-26

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—