Approximation algorithms for min-max path cover problems with service handling time

DOI10.1007/978-3-642-10631-6_40MaRDI QIDQ3652226zbMATH OpenOpenAlexFDO

Authors Zhou Xu, Liang Xu

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_40

zbMATH Keywords

approximation algorithminapproximabilitymin-max vehicle routingpath covers

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• Approximation results for min-max path cover problems in vehicle routing
• 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
• scientific article; zbMATH DE number 1875418
• Approximation algorithms for the traveling repairman and speeding deliveryman problems
• Approximation Schemes for Minimum Latency Problems

Cited in

(5)

• A dynamic edge covering and scheduling problem: complexity results and approximation algorithms
• Approximation results for min-max path cover problems in vehicle routing
• Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
• Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
• The multiple traveling salesman problem on spiders

This page was built for publication: Approximation algorithms for min-max path cover problems with service handling time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652226)