✦ LIBER ✦

An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p -Center Problem on a Tree

✍ Scribed by Chandrasekaran, R.; Tamir, A.

Book ID: 118212372
Publisher: Society for Industrial and Applied Mathematics
Year: 1980
Weight: 776 KB
Volume: 1
Category: Article
ISSN: 0196-5212
DOI: 10.1137/0601043

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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(pn2) algorithm for the p-median and

An O(pn2) algorithm for the p-median and related problems on tree graphs

✍ Arie Tamir 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 402 KB

An O(log n) parallel algorithm for const

An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs

✍ Wang Yue-Li; Chen Hon-Chan; Lee Chen-Yu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 396 KB

An O (n2) heuristic algorithm for the di

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

✍ J.MacGregor Smith; Judith S. Liebman 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 827 KB

An improved algorithm for the distance c

An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks

✍ Arie Tamir 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 66 KB 👁 1 views