Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.04127 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908393549070336 |
|---|---|
| author | Golak, Julian Sörensen, Finn Fliedner, Malte |
| author_facet | Golak, Julian Sörensen, Finn Fliedner, Malte |
| contents | In this work, we consider extensions of both the Line Traveling Salesman and Line Traveling Repairman Problem, in which a single server must service a set of clients located along a line segment under the assumption that not only the server, but also the clients can move along the line and seek to collaborate with the server to speed up service times. We analyze the structure of different problem versions and identify hard and easy subproblems by building up on prior results from the literature. Specifically, we investigate problem versions with zero or general processing times, clients that are either slower or faster than the server, as well as different time window restrictions. Collectively, these results map out the complexity landscape of the Line Traveling Salesman and Repairman Problem with collaboration. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_04127 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Line Traveling Salesman and Repairman Problem with Collaboration Golak, Julian Sörensen, Finn Fliedner, Malte Computational Complexity In this work, we consider extensions of both the Line Traveling Salesman and Line Traveling Repairman Problem, in which a single server must service a set of clients located along a line segment under the assumption that not only the server, but also the clients can move along the line and seek to collaborate with the server to speed up service times. We analyze the structure of different problem versions and identify hard and easy subproblems by building up on prior results from the literature. Specifically, we investigate problem versions with zero or general processing times, clients that are either slower or faster than the server, as well as different time window restrictions. Collectively, these results map out the complexity landscape of the Line Traveling Salesman and Repairman Problem with collaboration. |
| title | The Line Traveling Salesman and Repairman Problem with Collaboration |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2506.04127 |