๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The symmetric all-furthest- neighbor problem

โœ Scribed by Godfried T. Toussaint

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
654 KB
Volume
9
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The k-neighbor domination problem
The k-neighbor domination problem
โœ Shiow-Fen Hwang; Gerard J. Chang ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 314 KB
The problem with neighbors
The problem with neighbors
โœ Gary W. Paquin; Eileen Gambrill ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 840 KB
The p-neighbor k-center problem
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

The symmetric strong moment problem
The symmetric strong moment problem
โœ A.K. Common; J.H. McCabe ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 562 KB