On Finding Minimal Networks

conference paper

English

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.

minimum spanning tree, Steiner tree, approximation, heuristic

ŠEDA, M.

2001

20. 10. 2001

CSAEM/JCE Brno

Brno

28

31

4