Detail publikačního výsledku

On Finding Minimal Networks

ŠEDA, M.

Originální název

On Finding Minimal Networks

Anglický název

On Finding Minimal Networks

Druh

Stať ve sborníku v databázi WoS či Scopus

Originální abstrakt

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.

Anglický abstrakt

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.

Klíčová slova v angličtině

minimum spanning tree, Steiner tree, approximation, heuristic

Autoři

ŠEDA, M.

Vydáno

20.10.2001

Nakladatel

CSAEM/JCE Brno

Místo

Brno

Kniha

Proceedings of the 4th Japan-Central Europe Joint Workshop on Energy and Information in Non-Linear Systems

Strany od

28

Strany počet

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"
}