On Finding Minimal Networks
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F01%3APU23156" target="_blank" >RIV/00216305:26210/01:PU23156 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On Finding Minimal Networks
Original language description
In many utilities, including electrical and telecommunication systems, VLSI design, distributed networks of materials, the goal is to find connections of minimum cost. These connections have a form of trees and may be limited to a given set of points (minimum spanning trees) or admit the use of additional points (Steiner trees). This paper gives a brief survey of typical approximate and heuristic approaches to Steiner tree problems.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
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
Proceedings of the 4th Japan-Central Europe Joint Workshop on Energy and Information in Non-Linear Systems
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
28-31
Publisher name
CSAEM/JCE Brno
Place of publication
Brno
Event location
Brno
Event date
Nov 10, 2000
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—