✦ LIBER ✦

On a generalization of the p-Center Problem

✍ Scribed by S.O. Krumke

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 422 KB
Volume: 56
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00141-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On a generalization of the classical mom

On a generalization of the classical moment problem

✍ Konrad Schmüdgen 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 537 KB

On a Generalization of the 3x + 1 Proble

On a Generalization of the 3x + 1 Problem

✍ F. Mignosi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 565 KB

A generalization of the Oberwolfach prob

A generalization of the Oberwolfach problem

✍ S. I. El-Zanati; S. K. Tipnis; C. Vanden Eynden 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

## Abstract Let __n__ > 1 be an integer and let __a__~2~,__a__~3~,…,__a__~__n__~ be nonnegative integers such that $\sum\_{i=2}^{n} a\_i=2^{n-1} - 1$. Then $K\_{2^n}$ can be factored into $a\_2 C\_{2^2}$‐factors, $a\_3 C\_{2^3}$‐factors,…,$a\_n C\_{2^n}$‐factors, plus a 1‐factor. © 2002 Wiley Perio

On a Generalization of the 3x +&#xa

On a Generalization of the 3x + 1 Problem

✍ G. Venturini 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 202 KB

A vertex-closing approach to the p-cente

A vertex-closing approach to the p-center problem

✍ Joseph S. Martinich 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 980 KB

This article uses a vertex-closing approach to investigate the p-center problem. The optimal set of vertices to close are found in imbedded subgraphs of the original graph. Properties of these subgraphs are presented and then used to characterize the optimal solution, to establish a priori upper and