Boyd, S., Cheriyan, J., Haddadan, A., & Ibrahimpur, S. (2024). Approximation algorithms for flexible graph connectivity. Mathematical programming, 204(1-2), 493-516. https://doi.org/10.1007/s10107-023-01961-5
Citace podle Chicago (17th ed.)Boyd, Sylvia, Joseph Cheriyan, Arash Haddadan, a Sharat Ibrahimpur. "Approximation Algorithms for Flexible Graph Connectivity." Mathematical Programming 204, no. 1-2 (2024): 493-516. https://doi.org/10.1007/s10107-023-01961-5.
Citace podle MLA (9th ed.)Boyd, Sylvia, et al. "Approximation Algorithms for Flexible Graph Connectivity." Mathematical Programming, vol. 204, no. 1-2, 2024, pp. 493-516, https://doi.org/10.1007/s10107-023-01961-5.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..