APA (7th ed.) Citation

Toubaline, S., D’Ambrosio, C., Liberti, L., Poirion, P., Schieber, B., & Shachnai, H. (2018). Complexity and inapproximability results for the Power Edge Set problem. Journal of Combinatorial Optimization, 35(3), 895. https://doi.org/10.1007/s10878-017-0241-y

Chicago Style (17th ed.) Citation

Toubaline, Sonia, Claudia D’Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, and Hadas Shachnai. "Complexity and Inapproximability Results for the Power Edge Set Problem." Journal of Combinatorial Optimization 35, no. 3 (2018): 895. https://doi.org/10.1007/s10878-017-0241-y.

MLA (9th ed.) Citation

Toubaline, Sonia, et al. "Complexity and Inapproximability Results for the Power Edge Set Problem." Journal of Combinatorial Optimization, vol. 35, no. 3, 2018, p. 895, https://doi.org/10.1007/s10878-017-0241-y.