AN O (n log n)-TIME ALGORITHM FOR THE k-CENTER PROBLEM IN TREES.

MLA

Haitao Wang, and Jingru Zhang. “AN O (n Log n)-TIME ALGORITHM FOR THE k-CENTER PROBLEM IN TREES.” SIAM Journal on Computing, vol. 50, no. 2, Mar. 2021, pp. 602–35. EBSCOhost, https://doi.org/10.1137/18M1196522.

APA

Haitao Wang, & Jingru Zhang. (2021). AN O (n log n)-TIME ALGORITHM FOR THE k-CENTER PROBLEM IN TREES. SIAM Journal on Computing, 50(2), 602–635. https://doi.org/10.1137/18M1196522

Chicago

Haitao Wang, and Jingru Zhang. 2021. “AN O (n Log n)-TIME ALGORITHM FOR THE k-CENTER PROBLEM IN TREES.” SIAM Journal on Computing 50 (2): 602–35. doi:10.1137/18M1196522.