Publication detail
On Finding Minimal Networks
ŠEDA, M.
English title
On Finding Minimal Networks
Type
conference paper
Language
en
Original abstract
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.
English abstract
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.
Keywords in English
minimum spanning tree, Steiner tree, approximation, heuristic
RIV year
2001
Released
20.10.2001
Publisher
CSAEM/JCE Brno
Location
Brno
Book
Proceedings of the 4th Japan-Central Europe Joint Workshop on Energy and Information in Non-Linear Systems
Pages count
4
BIBTEX
@inproceedings{BUT6528,
author="Miloš {Šeda},
title="On Finding Minimal Networks",
booktitle="Proceedings of the 4th Japan-Central Europe Joint Workshop on Energy and Information in Non-Linear Systems",
year="2001",
month="October",
publisher="CSAEM/JCE Brno",
address="Brno"
}