Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k

Authors:
Tetsuo Asano;Naoki Katoh;Hisao Tamaki;Takeshi Tokuyama
Affiliations:
Dept. af Engr. Informatics, Osaka Electro-Communication University, Neyagawa 572, Japan;Dept. of Management Science, Kobe university of Commerce, Kobe 651-21, Japan;IBM Tokyo Research Laboratory, Yamato 242, Japan;IBM Tokyo Research Laboratory, Yamato 242, Japan
Venue:
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Year:
1997

Algorithms for capacitated vehicle routing

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
The k-traveling repairman problem

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Capacitated Vehicle Routing Problem on a Tree

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Approximation Schemes for Geometric NP-Hard Problems: A Survey

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
The k-traveling repairmen problem

ACM Transactions on Algorithms (TALG)
PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The school bus problem on trees

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Improved bounds for vehicle routing solutions

Discrete Optimization

Hi-index	0.01