✦ LIBER ✦

An O(n log n) algorithm for a maxmin location problem

✍ Scribed by C.Pandu Rangan; Ramesh Govindan

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 257 KB
Volume: 36
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90234-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n log n) algorithm for the convex b

An O(n log n) algorithm for the convex bipartite matching problem

✍ G. Gallo 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 197 KB

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

An O(n log n) algorithm for finding diss

An O(n log n) algorithm for finding dissimilar strings

✍ Sarmad Abbasi; Anirvan Sengupta 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 411 KB

Let P be a finite alphabet and x E Z'. A string y E Zm is said to be k-dissimilar to x, if no k length substring of x is equal to any k length substring of y. We present an 0( n log n) algorithm which on input x E 2? and an integer m < n outputs an integer k and y E .Zm such that: (1) y is k-dissimi

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 finding all

An O(n log n) algorithm for finding all repetitions in a string

✍ Michael G Main; Richard J Lorentz 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 602 KB

An O(n2log n) parallel max-flow algorith

An O(n2log n) parallel max-flow algorithm

✍ Yossi Shiloach; Uzi Vishkin 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 966 KB