Author:
Pan Pengxiang,Lichen Junran,Yang Ping,Li Jianping
Publisher
Springer Nature Switzerland
Reference16 articles.
1. Averbakh, I., Berman, O.: A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree. Discret. Appl. Math. 68(1–2), 17–32 (1996)
2. Campbell, A.M., Vandenbussche, D., Hermann, W.: Routing for relief efforts. Transp. Sci. 42(2), 127–145 (2008)
3. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem, Report 388. Carnegie Mellon University, Graduate School of Industrial Administration (1976)
4. Even, G., Garg, N., Koemann, J., Ravi, R., Sinha, A.: Min-max tree covers of graphs. Oper. Res. Lett. 32(4), 309–315 (2004)
5. Farbstein, B., Levin, A.: Min-max cover of a graph with a small number of parts. Discret. Optim. 16, 51–61 (2015)