# Multiple Traveling Salesmen in Asymmetric Metrics

@article{Friggstad2013MultipleTS, title={Multiple Traveling Salesmen in Asymmetric Metrics}, author={Zachary Friggstad}, journal={ArXiv}, year={2013}, volume={abs/1112.2930} }

We consider some generalizations of the Asymmetric Traveling Salesman Path Problem. In these variants, we have multiple salesmen that we are to move around a metric and the goal is to have each node visited by at least one salesman. This should be done while minimizing the total distance travelled by all salesmen.

4 Citations

Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing

- Mathematics, Computer Science
- STOC
- 2014

21- PDF

Fast, High-Quality Dual-Arm Rearrangement in Synchronous, Monotone Tabletop Setups

- Computer Science
- WAFR
- 2018

11- PDF

#### References

SHOWING 1-10 OF 48 REFERENCES

On the worst-case performance of some algorithms for the asymmetric traveling salesman problem

- Mathematics, Computer Science
- Networks
- 1982

262

On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem

- Computer Science, Mathematics
- Theory Comput.
- 2008

3- PDF

Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs

- Mathematics, Computer Science
- APPROX-RANDOM
- 2007

74- PDF

An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem

- Computer Science, Mathematics
- SODA
- 2010

125- PDF

Analysis of Christofides' heuristic: Some paths are more difficult than cycles

- Computer Science, Mathematics
- Oper. Res. Lett.
- 1991

56- PDF