References
Novik A (1996) Improved algorithms for locating tree or path shaped facilities on a tree network. M.S. Thesis, School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel
Puerto J, Ricca F, Scozzari A (2011) Minimax regret path location on trees. Networks 58(2):147–158
Wang B-F (1998) Finding a k-tree core and a k-tree center of a tree network in parallel. IEEE Trans Parallel Distrib Syst 9(2):186–191
Wang B-F (2002) A 2-core of a tree in linear time. SIAM J Discret Math 15(2):193–210
Wang B-F, Ku S-C, Shi K-H (2001) Cost-optimal parallel algorithms for the tree bisector and related problems. IEEE Trans Parallel Distrib Syst 12(9):888–898
Ye J-H (2017) Improved algorithms for minmax regret path location problems on trees. Ph.D. Dissertation, Department of Computer Science, Nation Tsing Hua University
Author information
Authors and Affiliations
Corresponding author
Additional information
This comment refers to the invited paper available at https://doi.org/10.1007/s11750-018-0476-5.
Rights and permissions
About this article
Cite this article
Wang, BF. Comments on: Extensive facility location problems on networks: an updated review. TOP 26, 233–235 (2018). https://doi.org/10.1007/s11750-018-0475-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-018-0475-6