Skip to main content
Log in

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

  • Discussion
  • Published:
TOP Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

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

    Google Scholar 

  • 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

    Article  Google Scholar 

  • Wang B-F (2002) A 2-core of a tree in linear time. SIAM J Discret Math 15(2):193–210

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • 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

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Biing-Feng Wang.

Additional information

This comment refers to the invited paper available at https://doi.org/10.1007/s11750-018-0476-5.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11750-018-0475-6

Navigation