A Sausage Heuristic for Steiner Minimal Trees in Three-Dimensional Euclidean Space

Given a set V of size N≥4 vertices in a metric space, how can one interconnect them with the possible use of a set S of size M vertices not in the set V, but in the same metric space, so that the cumulative cost of the inter-connections between all the vertices is a minimum? When one uses the Euclid...

Full description

Bibliographic Details
Published in:Journal of mathematical modelling and algorithms in operations research : JMMA, Vol. 4, No. 2 (2005), p. 199-217
Main Author: Toppur, Badri
Other Involved Persons: Smith, MacGregor
Format: electronic Article
Language:English
ISSN:2214-2495
Item Description:90C59.
Physical Description:Online-Ressource
DOI:10.1007/s10852-004-6390-x
Subjects:
QR Code: Show QR Code