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
โฆ LIBER โฆ
The conditional p-center problem in the plane
โ Scribed by R. Chen; Y. Handler
- Publisher
- John Wiley and Sons
- Year
- 1993
- Tongue
- English
- Weight
- 748 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0894-069X
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
On a generalization of the p-Center Prob
โ
S.O. Krumke
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 422 KB
The Circle Problem in the Hyperbolic Pla
โ
R. Phillips; Z. Rudnick
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 930 KB
A vertex-closing approach to the p-cente
โ
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
The sector problem in plane elastostatic
โ
B.S.Ramachandra Rao; C.S. Kale; R.P. Shimpi
๐
Article
๐
1973
๐
Elsevier Science
๐
English
โ 666 KB
A matching problem in the plane
โ
Mikhail J. Atallah
๐
Article
๐
1985
๐
Elsevier Science
๐
English
โ 428 KB