Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows

DOI10.1007/978-3-540-74208-1_9MaRDI QIDQ3603460zbMATH OpenOpenAlexFDO

Authors Greg N. Frederickson, Barry Wittman

Publication date 17 February 2009

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74208-1_9

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Approximation algorithms for the traveling repairman and speeding deliveryman problems
• Approximation Schemes for Minimum Latency Problems
• Special cases of traveling salesman and repairman problems with time windows
• On approximating a geometric prize-collecting traveling salesman problem with time windows
• Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.

Cited in

(5)

• Approximation algorithms for the traveling repairman and speeding deliveryman problems
• Approximating the \(k\)-traveling repairman problem with repair times
• Approximation Algorithms for Capacitated k-Travelling Repairmen Problems.
• On approximating a geometric prize-collecting traveling salesman problem with time windows
• On approximating a geometric prize-collecting traveling salesman problem with time windows (extended abstract)

Describes a project that uses

Uses Software

• TSPTW

This page was built for publication: Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows

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