35/44-approximation for asymmetric maximum TSP with triangle inequality
type: Item
instance of: scholarly article
title: 35/44-approximation for asymmetric maximum TSP with triangle inequality
zbMATH Open document ID: 1206.68367
author: Marcin Mucha
author: Łukasz Kowalik
published in: Algorithmica
publication date: 2011-03-02T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5859355
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: asymmetric maximum TSP
zbMATH Keywords: ATSP
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: s00453-009-9306-3
OpenAlex ID: W2149302127
cites work: Algorithms and Data Structures
cites work: An -approximation algorithm for the asymmetric maximum TSP
cites work: Better approximations for max TSP
cites work: A \(\frac78\)-approximation algorithm for metric Max TSP
cites work: A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP
cites work: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
cites work: Algorithms – ESA 2005
cites work: Matching theory
cites work: Q4411276
DOI: 10.1007/S00453-009-9306-3
description: scientific article; zbMATH DE number 5859355