Publisher
Springer Nature Singapore
Reference21 articles.
1. Gao, J., Zhao, Q., Swami, A.: The thinnest path problem for secure communications. A directed hypergraph approach. In: Allerton Conference on Communication, Control, and Computing, pp. 847–852 (2012)
2. Moberly, R.: A thinner thinnest path using directional transmissions in a network. In: Military Communications Conference, pp. 1026–1031 (2013)
3. Gao, J., Zhao, Q., Swami, A.: The thinnest path problem. IEEE-ACM Trans. Networking 23(4), 1176–1189 (2015)
4. Wu, S., Chen, Z., Wang, Y., Gao, X., Wu, F., Chen, G.: Efficient approximations for thinnest path problem in grid graph. In: Ubiquitous Information Management and Communication, pp. 1–8 (2018)
5. Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Advances in Neural Information Processing Systems (2015)