Author:
Aaron Eric,Krizanc Danny,Meyerson Elliot
Publisher
Springer International Publishing
Reference27 articles.
1. Aaron, E., Kranakis, E., Krizanc, D.: On the complexity of the multi-robot, multi-depot map visitation problem. In: IEEE MASS, pp. 795–800 (2011)
2. Aaron, E., Krizanc, D., Meyerson, E.: DMVP: foremost waypoint coverage of time-varying graphs (2014).
http://arxiv.org/abs/1407.7279
3. Ahr, D., Reinhelt, G.: A tabu search algorithm for the min-max k-Chinese postman problem. Comput. Oper. Res. 33(12), 3403–3422 (2006)
4. Akiyama, T., Nishizeki, T., Saito, N.: NP-completeness of the Hamiltonian cycle problem for bipartite graphs. J. Inf. Process. 3(2), 73–76 (1980)
5. Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. Distrib. Comput. 24(1), 31–44 (2011)
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献