Publication result detail

On Finding Minimal Networks

ŠEDA, M.

Original Title

On Finding Minimal Networks

English Title

On Finding Minimal Networks

Type

Paper in proceedings (conference paper)

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.

Key words in English

minimum spanning tree, Steiner tree, approximation, heuristic

Authors

ŠEDA, M.

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 from

28

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",
  pages="4",
  publisher="CSAEM/JCE Brno",
  address="Brno"
}