Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Šaltenis, Vydūnas
Affiliations: Institute of Mathematics and Informatics, Akademijos 4, 2600 Vilnius, Lithuania. E-mail: [email protected]
Abstract: The Steiner problem asks for the shortest network that spans a given set of fixed points in the Euclidean plane. The problem is NP hard. The result of simulation of an idealized “wet” film connecting fixed points is a length-minimizing curve. Increasing the exterior pressure step by step we are able to achieve the film configuration near to the Steiner minimal tree. “Dead-point” situations may occur for some symmetric allocation of fixed points. The limited simulation experiments show that the average computation time depends almost linearly on the number of fixed points for the situations without “dead-points”.
Keywords: optimization, Steiner problem, soap film, simulation, instability
DOI: 10.3233/INF-1999-10407
Journal: Informatica, vol. 10, no. 4, pp. 457-466, 1999
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]