MPI-INF/SWS Research Reports 1991-2021
2. Number - only D1
MPI-I-96-1-006
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
Das, Gautam and Kapoor, Sanjiv and Smid, Michiel
March 1996, 14 pages.
.Status: available - back from printing
We consider the problems of computing $r$-approximate traveling salesman tours and $r$-approximate minimum spanning trees for a set of $n$ points in $\IR^d$, where $d \geq 1$ is a constant.
In the algebraic computation tree model, the complexities of both these problems are shown to be $\Theta(n \log n/r)$, for all $n$ and $r$ such that $r
-
- Attachement: MPI-I-96-1-006.ps (149 KBytes); MPI-I-96-1-006.pdf (196 KBytes)
URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1996-1-006
BibTeX@TECHREPORT{DasKapoorSmid96,
AUTHOR = {Das, Gautam and Kapoor, Sanjiv and Smid, Michiel},
TITLE = {On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-96-1-006},
MONTH = {March},
YEAR = {1996},
ISSN = {0946-011X},
}