Algorithms for the universal and a priori TSP
type: Item
instance of: scholarly article
title: Algorithms for the universal and a priori TSP
zbMATH Open document ID: 1151.90040
author: Frans Schalekamp
author: David B. Shmoys
published in: Operations Research Letters
publication date: 2008-05-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5280645
zbMATH Keywords: a priori optimization
zbMATH Keywords: universal optimization
zbMATH Keywords: metric embedding
MaRDI profile type: Publication
full work available at URL: j.orl.2007.04.009
OpenAlex ID: W2068317683
cites work: An O(N log N) planar travelling salesman heuristic based on spacefilling curves
cites work: Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem
cites work: A Priori Optimization
cites work: The structure of circular decomposable metrics
cites work: Sometimes Travelling is Easy: The Master Tour Problem
cites work: A tight bound on approximating arbitrary metrics by tree metrics
cites work: Oblivious network design
cites work: Improved lower and upper bounds for universal TSP in planar metrics
cites work: A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
cites work: Universal approximations for TSP, Steiner tree, and set cover
cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
cites work: Spacefilling curves and the planar travelling salesman problem
DOI: 10.1016/J.ORL.2007.04.009
description: scientific article; zbMATH DE number 5280645