Min-weight double-tree shortcutting for metric TSP: bounding the approximation ratio
type: Item
instance of: scholarly article
zbMATH Open document ID: 1267.90162
author: Vladimir G. Deineko
author: Alexander Tiskin
published in: Electronic Notes in Discrete Mathematics
publication date: 2013-07-04T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6184185
zbMATH Keywords: approximation algorithms
zbMATH Keywords: metric TSP
zbMATH Keywords: double-tree shortcutting
MaRDI profile type: Publication
full work available at URL: j.endm.2009.02.004
OpenAlex ID: W1613650767
cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
cites work: Approximating the Metric TSP in Linear Time
cites work: The travelling salesman and the PQ-tree.
cites work: Tight bounds for christofides' traveling salesman heuristic
cites work: Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP
cites work: Q4461911
cites work: Q3693290
cites work: Good triangulations yield good tours
cites work: The Euclidean traveling salesman problem is NP-complete
cites work: On two geometric problems related to the travelling salesman problem
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
cites work: Q3931037
DOI: 10.1016/J.ENDM.2009.02.004
title: Min-weight double-tree shortcutting for metric TSP: bounding the approximation ratio
description: scientific article; zbMATH DE number 6184185