APA (7th ed.) Citation

Cui, T., & Hochbaum, D. S. (2010). Complexity of some inverse shortest path lengths problems. Networks, 56(1), 20-29. https://doi.org/10.1002/net.20344

Chicago Style (17th ed.) Citation

Cui, Tingting, and Dorit S. Hochbaum. "Complexity of Some Inverse Shortest Path Lengths Problems." Networks 56, no. 1 (2010): 20-29. https://doi.org/10.1002/net.20344.

MLA (9th ed.) Citation

Cui, Tingting, and Dorit S. Hochbaum. "Complexity of Some Inverse Shortest Path Lengths Problems." Networks, vol. 56, no. 1, 2010, pp. 20-29, https://doi.org/10.1002/net.20344.