✦ LIBER ✦

Computation of Minimal Length Full Steiner Trees on the Vertices of a Convex Polygon

✍ Scribed by E. J. Cockayne

Book ID: 118219298
Publisher: American Mathematical Society
Year: 1969
Tongue: English
Weight: 305 KB
Volume: 23
Category: Article
ISSN: 0025-5718
DOI: 10.2307/2004379

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound on the number of unit dist

A lower bound on the number of unit distances between the vertices of a convex polygon

✍ Herbert Edelsbrunner; Péter Hajnal 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 218 KB

The Steiner tree problem for terminals o

The Steiner tree problem for terminals on the boundary of a rectilinear polygon

✍ Siu-Wing Cheng 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 233 KB

Given a simple rectilinear polygon P with k sides and n terminals on its boundary, we present an O(k 3 n)-time algorithm to compute the minimal rectilinear Steiner tree lying inside P interconnecting the terminals. We obtain our result by proving structural properties of a selective set of minimal S

On Finding the Expected Length of a Rand

On Finding the Expected Length of a Random Minimal Tree

✍ Timofeev, E. A. 📂 Article 📅 1989 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 429 KB

[Lecture Notes in Computer Science] Inte

[Lecture Notes in Computer Science] Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems Volume 3524 || On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price

✍ Barták, Roman; Milano, Michela 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg ⚖ 211 KB

[IEEE Comput. Soc. Press 1990 IEEE Inter

[IEEE Comput. Soc. Press 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers - Santa Clara, CA, USA (11-15 Nov. 1990)] 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers - A new class of Steiner tree heuristics with good performance: the iterated 1-Steiner approach

✍ Kahng, A.; Robins, G. 📂 Article 📅 1990 🏛 IEEE Comput. Soc. Press ⚖ 304 KB

[IEEE Fourth International Conference on

[IEEE Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies - Chengdu, China (27-29 Aug. 2003)] Proceedings of the 8th International Scientific and Practical Conference of Students, Post-graduates and Young Scientists. Modern Technique and Technologies. MTT'2002 (Cat. No.02EX550) - A self-stabilizing algorithm for the distributed minimal k-redundant dominating set problem in tree networks

✍ Kamei, S.; Kakugawa, H. 📂 Article 📅 2003 🏛 IEEE ⚖ 354 KB