APA (7th ed.) Citation

Amaldi, E., Coniglio, S., Koster, A. M., & Tieves, M. (2016). On the computational complexity of the virtual network embedding problem. Electronic notes in discrete mathematics, 52, 213-220. https://doi.org/10.1016/j.endm.2016.03.028

Chicago Style (17th ed.) Citation

Amaldi, Edoardo, Stefano Coniglio, Arie M.C.A Koster, and Martin Tieves. "On the Computational Complexity of the Virtual Network Embedding Problem." Electronic Notes in Discrete Mathematics 52 (2016): 213-220. https://doi.org/10.1016/j.endm.2016.03.028.

MLA (9th ed.) Citation

Amaldi, Edoardo, et al. "On the Computational Complexity of the Virtual Network Embedding Problem." Electronic Notes in Discrete Mathematics, vol. 52, 2016, pp. 213-220, https://doi.org/10.1016/j.endm.2016.03.028.