APA (7th ed.) Citation

D'Emidio, M., lizzi, L., Frigioni, D., Leucci, S., & Proietti, G. (2018, January 31). Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem. arXiv.org.

Chicago Style (17th ed.) Citation

D'Emidio, Mattia, Luca lizzi, Daniele Frigioni, Stefano Leucci, and Guido Proietti. "Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem." ArXiv.org 31 Jan. 2018.

MLA (9th ed.) Citation

D'Emidio, Mattia, et al. "Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem." ArXiv.org, 31 Jan. 2018.