Operations, Information and Decisions Papers

Document Type

Journal Article

Date of this Version

1981

Publication Source

The Annals of Probability

Volume

9

Issue

3

Start Page

365

Last Page

376

DOI

10.1214/aop/1176994411

Abstract

A limit theorem is established for a class of random processes (called here subadditive Euclidean functionals) which arise in problems of geometric probability. Particular examples include the length of shortest path through a random sample, the length of a rectilinear Steiner tree spanned by a sample, and the length of a minimal matching. Also, a uniform convergence theorem is proved which is needed in Karp's probabilistic algorithm for the traveling salesman problem.

Comments

At the time of publication, author John M Steele was affiliated with the Stanford University. Currently (June 2016), he is a faculty member in the Information and Decisions Department of the Wharton School at the University of Pennsylvania.

Share

COinS
 

Date Posted: 27 November 2017

This document has been peer reviewed.