Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time

DOI10.1007/978-3-642-10631-6_40zbMath1273.68413OpenAlexW2147590614MaRDI QIDQ3652226

Liang Xu, Zhou 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)

Related Items (3)

The multiple traveling salesman problem on spiders ⋮ 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

This page was built for publication: Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time