Miller, Z., Pritikin, D., Perkel, M., & Sudborough, I. (2005). The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem. Networks, 45(3), 143-164. https://doi.org/10.1002/net.20057
Citácia podle Chicago (17th ed.)Miller, Zevi, Dan Pritikin, Manley Perkel, a I.H Sudborough. "The Sequential Sum Problem and Performance Bounds on the Greedy Algorithm for the On-line Steiner Problem." Networks 45, no. 3 (2005): 143-164. https://doi.org/10.1002/net.20057.
Citácia podľa MLA (8th ed.)Miller, Zevi, et al. "The Sequential Sum Problem and Performance Bounds on the Greedy Algorithm for the On-line Steiner Problem." Networks, vol. 45, no. 3, 2005, pp. 143-164, https://doi.org/10.1002/net.20057.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..