𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Errol L Lloyd

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
458 KB
Volume
4
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm to solve the m Γ— n assignme
An algorithm to solve the m Γ— n assignment problem in expected time O(mn log n)
✍ Richard M. Karp πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 428 KB

## Abstract We give an algorithm to solve the __m__‐source, __n__‐destination assignment problem in expected time __O(mn__ log __n__) under the assumption that the edge costs are independent random variables and the costs of the edges incident with any given source are identically distributed. The

AnO(log*n) Approximation Algorithm for t
AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
✍ Rina Panigrahy; Sundar Vishwanathan πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 130 KB

The input to the asymmetric p-center problem consists of an integer p and an n = n distance matrix D defined on a vertex set V of size n, where d gives the i j distance from i to j. The distances are assumed to obey the triangle inequality. For a subset S : V the radius of S is the minimum distance