Chandrasekaran, R., & Tamir, A. (1980). An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p -Center Problem on a Tree. SIAM journal on algebraic and discrete methods, 1(4), 370-375. https://doi.org/10.1137/0601043
Chicago Style (17th ed.) CitationChandrasekaran, R., and A. Tamir. "An $O ( ( N\log P )^2 )$ Algorithm for the Continuous P -Center Problem on a Tree." SIAM Journal on Algebraic and Discrete Methods 1, no. 4 (1980): 370-375. https://doi.org/10.1137/0601043.
MLA (9th ed.) CitationChandrasekaran, R., and A. Tamir. "An $O ( ( N\log P )^2 )$ Algorithm for the Continuous P -Center Problem on a Tree." SIAM Journal on Algebraic and Discrete Methods, vol. 1, no. 4, 1980, pp. 370-375, https://doi.org/10.1137/0601043.
Warning: These citations may not always be 100% accurate.