An improved approximation ratio for the minimum latency problem
- 1 June 1998
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 82 (1-2) , 111-124
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A General Approximation Technique for Constrained Forest ProblemsSIAM Journal on Computing, 1995
- The minimum latency problem1994
- The Delivery Man Problem and Cumulative MatroidsOperations Research, 1993
- Searching in the PlaneInformation and Computation, 1993
- Survivable networks, linear programming relaxations and the parsimonious propertyMathematical Programming, 1993
- A note on the prize collecting traveling salesman problemMathematical Programming, 1993
- Special cases of traveling salesman and repairman problems with time windowsNetworks, 1992
- The delivery man problem on a tree networkAnnals of Operations Research, 1989
- The complexity of the travelling repairman problemRAIRO - Theoretical Informatics and Applications, 1986
- P-Complete Approximation ProblemsJournal of the ACM, 1976