✦ LIBER ✦

Algorithms for the m-center problems: A survey

✍ Scribed by Jonathan Halpern; Oded Maimon

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 621 KB
Volume: 10
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(82)90136-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A survey of algorithms for the generaliz

A survey of algorithms for the generalized assignment problem

✍ Dirk G. Cattrysse; Luk N. Van Wassenhove 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 889 KB

A faster algorithm for the two-center de

A faster algorithm for the two-center decision problem

✍ John Hershberger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 569 KB

A relaxation-based algorithm for solving

A relaxation-based algorithm for solving the conditional -center problem

✍ Doron Chen; Reuven Chen 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 228 KB

A fast algorithm for the alpha-connected

A fast algorithm for the alpha-connected two-center decision problem

✍ Po-Hsueh Huang; Yin Te Tsai; Chuan Yi Tang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 90 KB

This paper considers the problem of determining whether a set of points can be covered by two discs with centers p and q and common radius r, such that the ratio d(p, q)/r is bounded below by a specified constant, α. An O(n 2 log 2 n) algorithm for solving this problem is also presented.

A sweepline algorithm to solve the two-c

A sweepline algorithm to solve the two-center problem

✍ Nen-Fu Huang; Ching-Ho Huang; Yue-Li Wang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 684 KB

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