Algorithms for capacitated vehicle routing

Authors:
Moses Charikar;Samir Khuller;Balaji Raghavachari
Affiliations:
Department of Computer Science, Stanford University;Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park;Department of Computer Science, University of Texas, Dallas
Venue:
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Year:
1998

Citing 11
Cited 3

Efficient solutions to some transportation problems with applications to minimizing robot arm travel

SIAM Journal on Computing
Preemptive ensemble motion planning on a tree

SIAM Journal on Computing
A note on the complexity of a simple transportation problem

SIAM Journal on Computing
Nonpreemptive ensemble motion planning on a tree

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

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems

SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Polynomial time approximation schemes for Euclidean TSP and other geometric problems

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Graph Theory With Applications

Graph Theory With Applications

Data gathering tours in sensor networks

Proceedings of the 5th international conference on Information processing in sensor networks
Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Approximation algorithms for min-max capacitated path covers

CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109

Quantified Score

Hi-index	0.01

Visualization

Abstract