Hostname: page-component-74656f9884-g96k6 Total loading time: 0 Render date: 2026-11-10T06:35:47.590Z Has data issue: false hasContentIssue false
  • English
  • Français

Steinhaus's geometric location problem for random samples in the plane

Published online by Cambridge University Press:  01 July 2016

Dorit Hochbaum  and
J. Michael Steele
Dorit Hochbaum*
Affiliation:
Carnegie-Mellon University
J. Michael Steele*
Affiliation:
Stanford University
*
∗ Postal address: Graduate School of Industrial Administration, Carnegie–Mellon University, Pittsburgh, PA 15213, U.S.A.
∗∗ Postal address: Department of Statistics, Stanford University, Stanford, CA 94305, U.S.A.
Get access Rights & Permissions [Opens in a new window]

Abstract

Let

where Xi , 1 ≦ i ≦ n, are i.i.d. and uniformly distributed in [0, 1]2. It is proved that Mn ∽ cn 1–p/2 a.s. for 1 ≦ p <2. This result is motivated by recent developments in the theory of algorithms and the theory of subadditive processes as well as by a well-known problem of H. Steinhaus.

Keywords

LOCATION PROBLEMk-MEDIAN PROBLEMPROBABILISTIC ALGORITHMSUBADDITIVE PROCESSSUBADDITIVE EUCLIDEAN FUNCTIONAL

Information

Type
Research Article
Information
Advances in Applied Probability , Volume 14 , Issue 1 , March 1982 , pp. 56 - 67
Copyright
Copyright © Applied Probability Trust 1982 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

Research supported in part by the Office of Naval Research Contract N00014-76-C-0475.

References

Beardwood, J., Halton, H. J. and Hammersley, J. M. (1959) The shortest path through many points. Proc. Camb. Phil. Soc. 55, 299–327.Google Scholar
Bollobás, B. (1973) The optimal arrangement of producers. J. London Math. Soc. (2) 6, 417–421.Google Scholar
Cornuejols, G., Fisher, M. L. and Nemhauser, G. L. (1978) Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Management Sci. 23, 789–810.Google Scholar
Doetsch, G. (1943) Theorie und Anwendung der Laplace-Transformation. Dover, New York.Google Scholar
Efron, B. and Stein, C. (1981) The jackknife estimate of variance. Ann. Statist. 9, 586–596.Google Scholar
Feller, W. (1971) An Introduction to Probability Theory and its Applications, Vol. II, 2nd edn. Wiley, New York.Google Scholar
Fejes-Tóth, L. (1959) Sur la représentation d'une population infinie par un nombre fini d'éléments. Acta Math. Acad. Sci. Hungar. 10, 299–304.Google Scholar
Fisher, M. L. and Hochbaum, O. S. (1980) Probabilistic analysis of the K-median problem. Math. Operat. Res. 5, 27–34.Google Scholar
Karp, R. M. (1972) Reducibility among combinatorial problems. In Complexity of Computer Computations, ed. Miller, R. E. and Thatcher, J. W., Plenum Press, New York, 85–104.Google Scholar
Karp, R. M. (1977) Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane. Math. Operat. Res. 2, 209–224.CrossRefGoogle Scholar
McClure, D. E. (1976) Characterization and approximation of optimal plane partitions. Technical Report, Division of Applied Mathematics, Brown University.Google Scholar
Papadimitriou, C. H. (1981) Worst case and probabilistic analysis of a geometric location problem. SIAM J. Computing 10, 542–557.Google Scholar
Starret, D. A. (1974) Principles of optimal location in a large homogeneous area. J. Econom. Theory 9, 418–448.Google Scholar
Steele, J. M. (1981a) Subadditive Euclidean functionals and non-linear growth in geometric probability. Ann. Prob. 9, 365–376.CrossRefGoogle Scholar
Steele, J. M. (1981b) Optimal triangulation of random samples in the plane. Ann. Prob. CrossRefGoogle Scholar
Steele, J. M. (1981c) Growth rates of minimal spanning trees of random samples in space. Z. Wahrscheinlichkeitsth. Google Scholar
Steinhaus, H. (1956) Sur la division de corps matériels en parties. Bull. Acad. Polon. Sci. 4, 801–804.Google Scholar