✦ LIBER ✦

On the k-center problem with many centers

✍ Scribed by WanSoo T. Rhee; Michel Talagrand

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 323 KB
Volume: 8
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(89)90015-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Many-centered and one-centered plethysms

Many-centered and one-centered plethysms in the problem of many centers

✍ B. A. Men; P. T. Varshavsky; A. N. Men 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 411 KB

## Abstract The concept of a “multi‐centered plethysm” for multinuclear problems is defined and studied. Schemes of links of atoms in molecules or complexes and corresponding schemes of the group reductions are considered.

The p-neighbor k-center problem

✍ Shiva Chaudhuri; Naveen Garg; R. Ravi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 389 KB

The k-center problem with triangle inequality is that of placing k center nodes in a weighted undirected graph in which the edge weights obey the triangle inequality, so that the maximum distance of any node to its nearest center is minimized. In this paper, we consider a generalization of this prob

Correlated wave-function theory for many

✍ Dmitry A. Shershakov; Vladimir V. Nechaev 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB

The correlated electronic wave-function theory developed by S. Obara w Ž .x and K. Hirao Bull. Chem. Soc. Jpn. 66, 3300 1993 , as applied to two-electron molecular systems, is generalized to many-center many-electron problems. The exact formulas for effective Hamiltonian operators are given. The rul

Fault tolerant K-center problems

✍ Samir Khuller; Robert Pless; Yoram J. Sussmann 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 98 KB

The basic K-center problem is a fundamental facility location problem, where we are asked to locate K facilities in a graph, and to assign vertices to facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned. This problem is known to be NPhard, and sev

The 2-Center Problem with Obstacles

✍ Dan Halperin; Micha Sharir; Ken Goldberg 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Given a set S of n points in the plane and a set O of pairwise disjoint simple polygons with a total of m edges, we wish to find two congruent disks of smallest radius whose union covers S and whose centers lie outside the polygons in O (referred to as locational constraints in facility location the

On the rectangular p-center problem

✍ Zvi Drezner 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 322 KB

The p-center problem involves finding the best locations for p facilities such that the furthest among n points is as close as possible to one of the facilities. Rectangular (sometimes called rectilinear, Manhattan, or 1,) distances are considered. An O ( n ) algorithm for the 1-center problem, an O