An improved approximation ratio for the minimum latency problem
type: Item
instance of: scholarly article
title: An improved approximation ratio for the minimum latency problem
zbMATH Open document ID: 0920.90138
DOI: 10.1007/BF01585867
author: Michel X. Goemans
author: Jon M. Kleinberg
published in: Mathematical Programming. Series A. Series B
publication date: 1999-09-15T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1294686
zbMATH Keywords: approximation algorithms
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: traveling repairman
zbMATH Keywords: minimum latency problem
zbMATH Keywords: approximation ratio
MaRDI profile type: Publication
cites work: The minimum latency problem
cites work: The delivery man problem on a tree network
cites work: Special cases of traveling salesman and repairman problems with time windows
cites work: P-Complete Approximation Problems
cites work: The complexity of the travelling repairman problem
cites work: The Delivery Man Problem and Cumulative Matroids
cites work: Searching in the plane
cites work: A General Approximation Technique for Constrained Forest Problems
cites work: Q4228499
cites work: A note on the prize collecting traveling salesman problem
cites work: Survivable networks, linear programming relaxations and the parsimonious property
cites work: Heuristic analysis, linear programming and branch and bound
cites work: Analyzing the Held-Karp TSP bound: A monotonicity property with application
cites work: Q4234076
cites work: Q4234074
description: scientific article; zbMATH DE number 1294686