pp 1–3 | Cite as

Comments on: Extensive facility location problems on networks: an updated review



  1. 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, IsraelGoogle Scholar
  2. Puerto J, Ricca F, Scozzari A (2011) Minimax regret path location on trees. Networks 58(2):147–158Google Scholar
  3. 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–191CrossRefGoogle Scholar
  4. Wang B-F (2002) A 2-core of a tree in linear time. SIAM J Discret Math 15(2):193–210CrossRefGoogle Scholar
  5. 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–898CrossRefGoogle Scholar
  6. Ye J-H (2017) Improved algorithms for minmax regret path location problems on trees. Ph.D. Dissertation, Department of Computer Science, Nation Tsing Hua UniversityGoogle Scholar

Copyright information

© Sociedad de Estadística e Investigación Operativa 2018

Authors and Affiliations

  1. 1.Department of Computer ScienceNational Tsing Hua UniversityHsinchuTaiwan, ROC

Personalised recommendations