Operations, Information and Decisions Papers

Document Type

Journal Article

Date of this Version

4-1989

Publication Source

SIAM Journal on Computing

Volume

18

Issue

2

Start Page

278

Last Page

287

DOI

10.1137/0218019

Abstract

A method is presented for determining the asymptotic worst-case behavior of quantities like the length of the minimal spanning tree or the length of an optimal traveling salesman tour of $n$ points in the unit $d$-cube. In each of these classical problems, the worst-case lengths are proved to have the exact asymptotic growth rate of $\beta _n^{{{(d - 1)} / d}} $, where $\beta $ is a positive constant depending on the problem and the dimension. These results complement known results on the growth rates for the analogous quantities under probabilistic assumptions on the points, but the results given here are free of any probabilistic hypotheses.

Keywords

asymptotics, traveling salesman problem, minimal spanning tree, Beardwood-Halton-Hammersley theorem

Share

COinS
 

Date Posted: 27 November 2017

This document has been peer reviewed.