The paper classifies collaborative line traveling salesman and repairman variants, giving polynomial algorithms for several cases and strong NP-hardness for deadlines.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Line Traveling Salesman and Repairman Problem with Collaboration
The paper classifies collaborative line traveling salesman and repairman variants, giving polynomial algorithms for several cases and strong NP-hardness for deadlines.