Wu, C., Xu, D., Du, D., & Xu, W. (2016). An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding. Journal of combinatorial optimization, 32(4), 1017-1035. https://doi.org/10.1007/s10878-015-9880-z
Citácia podle Chicago (17th ed.)Wu, Chenchen, Dachuan Xu, Donglei Du, a Wenqing Xu. "An Approximation Algorithm for the Balanced Max-3-Uncut Problem Using Complex Semidefinite Programming Rounding." Journal of Combinatorial Optimization 32, no. 4 (2016): 1017-1035. https://doi.org/10.1007/s10878-015-9880-z.
Citácia podľa MLA (8th ed.)Wu, Chenchen, et al. "An Approximation Algorithm for the Balanced Max-3-Uncut Problem Using Complex Semidefinite Programming Rounding." Journal of Combinatorial Optimization, vol. 32, no. 4, 2016, pp. 1017-1035, https://doi.org/10.1007/s10878-015-9880-z.