On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees

DOI10.1007/PL00009183zbMath0898.68097OpenAlexW2037310342MaRDI QIDQ1386771

Gautam K. Das, Michiel H. M. Smid, Sanjiv Kapoor

Publication date: 10 November 1998

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009183

zbMATH Keywords

minimum spanning treestraveling salesman tours

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

A lower bound for approximating the geometric minimum weight matching

This page was built for publication: On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees