Citace podle APA (7th ed.)

Saikia, P., & Karmakar, S. (2019, November). 2(1 - 1/ℓ)-Factor Steiner Tree Approximation in Õ(n^1/3) Rounds in the CONGESTED CLIQUE. International Symposium on Computing and Networking (Online), 82-91. https://doi.org/10.1109/CANDAR.2019.00018

Citace podle Chicago (17th ed.)

Saikia, Parikshit, a Sushanta Karmakar. "2(1 - 1/ℓ)-Factor Steiner Tree Approximation in Õ(n^1/3) Rounds in the CONGESTED CLIQUE." International Symposium on Computing and Networking (Online) Nov. 2019: 82-91. https://doi.org/10.1109/CANDAR.2019.00018.

Citace podle MLA (9th ed.)

Saikia, Parikshit, a Sushanta Karmakar. "2(1 - 1/ℓ)-Factor Steiner Tree Approximation in Õ(n^1/3) Rounds in the CONGESTED CLIQUE." International Symposium on Computing and Networking (Online), Nov. 2019, pp. 82-91, https://doi.org/10.1109/CANDAR.2019.00018.

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..