Abstract
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled by vehicles. We design constant differential approximation algorithms for some of these problems. In particular we obtain differential bounds: 1/2 for Metric 3VRP, 3/5 for Metric 4VRP, 2/3 for Metric kVRP with k ≥ 5, 1/2 for the nonmetric case for any k ≥ 3, and 1/3 for Constrained VRP. We prove also that Min-Sum EkTSP is 2/3 differential approximable and has no differential approximation scheme, unless P = NP.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
