Abstract
We consider the problems of computing r-approximate traveling salesman tours and r-approximate minimum spanning trees for a set of n points in ℝd, where d≥ 1 is a constant. In the algebraic computation tree model, the complexities of both these problems are shown to be θ(nlog(n/r)), for all n and r such that r
Cite
CITATION STYLE
APA
Das, G., Kapoor, S., & Smid, M. (1996). On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1180, pp. 64–75). Springer Verlag. https://doi.org/10.1007/3-540-62034-6_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free