Skip to content

Author

Daniel A. Skachkov

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Nov 2026

A polynomial-time approximation scheme for the weighted Euclidean Minimum Latency Problem in fixed dimension

In the Traveling Salesman Problem, a route must visit all customers and return to its starting point while minimizing its total length. The Minimum Latency Problem, also known as the Traveling Repairman Problem, instead minimizes the sum of the times at which customers are first visited. We give a deterministic polynom...

Daniel A. Skachkov, Y. Dorn · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.