A primal-dual approximation algorithm for the asymmetric prize-collecting TSP
type: Item
instance of: scholarly article
title: A primal-dual approximation algorithm for the asymmetric prize-collecting TSP
zbMATH Open document ID: 1268.90070
author: Viet Hung Nguyen
published in: Journal of Combinatorial Optimization
publication date: 2013-03-25T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6148665
zbMATH Keywords: prize collecting traveling salesman
zbMATH Keywords: approximation algorithm
zbMATH Keywords: primal-dual algorithm
MaRDI profile type: Publication
full work available at URL: s10878-012-9501-z
OpenAlex ID: W2117443767
cites work: Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP
cites work: On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
cites work: The prize collecting traveling salesman problem
cites work: A note on the prize collecting traveling salesman problem
cites work: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
cites work: A General Approximation Technique for Constrained Forest Problems
cites work: Approximating the asymmetric profitable tour
DOI: 10.1007/S10878-012-9501-Z
description: scientific article; zbMATH DE number 6148665