New differential approximation algorithm for k-customer vehicle routing problem

Authors:
Takayuki Nagoya
Affiliations:
Department of Information Systems, Tottori University of Environmental Studies, 1-1-1 Wakabadai-Kita, Tottori, Tottori 689-1111, Japan
Venue:
Information Processing Letters
Year:
2009

Citing 12
Cited 1

Approximation results for the minimum graph coloring problem

Information Processing Letters
On an approximation measure founded on the links between optimization and polynomial approximation theory

Theoretical Computer Science
Approximation of k-set cover by semi-local optimization

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Differential approximation algorithms for some combinatorial optimization problems

Theoretical Computer Science
Approximating discrete collections via local improvements

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
z-Approximations

Journal of Algorithms
Differential approximation results for the traveling salesman and related problems

Information Processing Letters
Approximation algorithms for some vehicle routing problems

Discrete Applied Mathematics
On the differential approximation of MIN SET COVER

Theoretical Computer Science
A better differential approximation ratio for symmetric TSP

Theoretical Computer Science
The maximum saving partition problem

Operations Research Letters
Independent sets in bounded-degree hypergraphs

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Differential approximation of the multiple stacks TSP

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a differential approximation algorithm for k-customer vehicle routing problem. It is known that this problem is 12 differential approximable for k=3. It is also known that if the triangle inequality is satisfied then this problem is 35 differential approximable for k=4 and 23 differential approximable for 5==5 without assuming the triangle inequality holds.