✦ LIBER ✦

An O (n2) heuristic algorithm for the directed Steiner minimal tree problem

✍ Scribed by J.MacGregor Smith; Judith S. Liebman

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 827 KB
Volume: 4
Category: Article
ISSN: 0307-904X
DOI: 10.1016/0307-904x(80)90163-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n log n) heuristic for steiner mini

An O(n log n) heuristic for steiner minimal tree problems on the euclidean metric

✍ J. Macgregor Smith; D. T. Lee; Judith S. Liebman 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 789 KB

An O(m log n) algorithm for the max + su

An O(m log n) algorithm for the max + sum spanning tree problem

✍ Abraham P. Punnen; K.P.K. Nair 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 240 KB

O(n2.5) time algorithms for the subgraph

O(n2.5) time algorithms for the subgraph homeomorphism problem on trees

✍ Moon Jung Chung 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 346 KB

An O(log m) parallel algorithm for the m

An O(log m) parallel algorithm for the minimum spanning tree problem

✍ Francis Suraweera; Prabir Bhattacharya 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 481 KB

Experimental evaluation of a partitionin

Experimental evaluation of a partitioning algorithm for the steiner tree problem in R2 and R3

✍ Sivakumar Ravada; Alan T. Sherman 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 614 KB

## Abstract We experimentally evaluate sequential and distributed implementations of an approximation partitioning algorithm by Kalpakis and Sherman for the __Geometric Steiner Minimum Tree Problem (GSMT)__ in __R^d^__ for __d__ = 2,3. Our implementations incorporate an improved method for combinin

An O(n log m) algorithm for the Josephus

An O(n log m) algorithm for the Josephus Problem

✍ Errol L Lloyd 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 458 KB