1. Antoniadis, A., Barcelo, N., Cole, D., Fox, K., Moseley, B., Nugent, M., & Pruhs, K. (2014). Packet forwarding algorithms in a line network. In LATIN 2014: Theoretical informatics—11th Latin American symposium, Montevideo, Uruguay, March 31—April 4, 2014. Proceedings (pp. 610–621).
2. Bansal, N., Kimbrel, T., & Sviridenko, M. (2006). Job shop scheduling with unit processing times. Mathematics of Operations Research, 31(2), 381–389.
3. Bhattacharya, S., Kulkarni, J. & Mirrokni, V. S. (2014). Coordination mechanisms for selfish routing over time on a tree. In Automata, languages, and programming—41st international colloquium, ICALP 2014, Copenhagen, Denmark, July 8–11, 2014, Proceedings, Part I (pp. 186–197).
4. Chaudhuri, K., Godfrey, B., Rao, S., & Talwar, K. (2003). Paths, trees, and minimum latency tours. In 44th symposium on foundations of computer science (FOCS 2003), October 11–14, 2003, Cambridge, MA, USA, proceedings (pp. 36–45).
5. Cook, W. J., Cunningham, W. H., Pulleyblank, W. R., & Schrijver, A. (1998). Combinatorial optimization. New York, NY: Wiley.