✦ LIBER ✦

An O(n log n) algorithm for suboptimal rectilinear Steiner trees

✍ Scribed by Hwang, F.

Book ID: 117914058
Publisher: IEEE
Year: 1979
Weight: 324 KB
Volume: 26
Category: Article
ISSN: 0098-4094
DOI: 10.1109/tcs.1979.1084551

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal algorithm for rectilinear ste

An optimal algorithm for rectilinear steiner trees for channels with obstacles

✍ Charles Chiang; Majid Sarrafzadeh; C. K. Wong 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 835 KB

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 ( n log n ) Algorithm for the Maxim

An O ( n log n ) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

✍ Cole, Richard; Farach-Colton, Martin; Hariharan, Ramesh; Przytycka, Teresa; Thor 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 238 KB

An O(log n) algorithm for parallel updat

An O(log n) algorithm for parallel update of minimum spanning trees

✍ Shaunak Pawagi; I.V. Ramakrishnan 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 530 KB

An O(n log n log log n) parallel maximum

An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs

✍ Taenam Kim; Kyung-Yong Chwa 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 170 KB

An O(n log n) Manhattan path algorithm

✍ Witold Lipski Jr. 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 262 KB