{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:48:11Z","timestamp":1774421291600,"version":"3.50.1"},"reference-count":21,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":3967,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1995,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Location of facilities on tree networks is an important problem in transportation and telecommunication systems. For tree networks, The best\u2010known algorithm to find 2\u2010medians has a time complexity of <jats:italic>O<\/jats:italic>(<jats:italic>n<\/jats:italic><jats:sup>2<\/jats:sup>). By exploiting the properties relating the 1\u2010median and the 2\u2010medians in tree networks, and the properties inherent in tree structure, an improved algorithm is developed for computing the 2\u2010median. The time complexity of this algorithm is <jats:italic>O<\/jats:italic>(<jats:italic>n<\/jats:italic> lg <jats:italic>n<\/jats:italic>). The details of the algorithm are described along with an illustrative example.<\/jats:p>","DOI":"10.1002\/net.3230260413","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T21:18:30Z","timestamp":1179004710000},"page":"305-317","source":"Crossref","is-referenced-by-count":42,"title":["Computing the 2\u2010median on tree networks in O(n lg n) time"],"prefix":"10.1002","volume":"26","author":[{"given":"Bezalel","family":"Gavish","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suresh","family":"Sridhar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02024584"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(87)90034-7"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.24.4.628"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.8.3.217"},{"key":"e_1_2_1_6_2","unstructured":"B.Gavish Modeling of the single period outside plant design problem. Technical Report. GTE Laboratories (1987)."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.5.2.212"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.4.4.406"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.3.450"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.3.462"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.20.5.967"},{"key":"e_1_2_1_12_2","volume-title":"Location on Networks: Theory and Algorithms","author":"Handler G. Y.","year":"1979"},{"key":"e_1_2_1_13_2","first-page":"77","article-title":"Applications of mathematical methods to wheat harvesting","volume":"2","author":"Hua L. K.","year":"1962","journal-title":"Chin. Math."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1137\/0137041"},{"key":"e_1_2_1_15_2","unstructured":"D. W.Matula andR.Kolde Efficient multi\u2010median location in acyclic networks. ORSA\/TIMS Bull. No. 2 (1976)."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.13.2.85"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100405"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.25.4.641"},{"key":"e_1_2_1_19_2","unstructured":"A.Rosenthal M.Hersey J.PinoandM.Coulter A generalized algorithm for centrality problems on trees. Proceedings of the Allerton Conference on Communication Control and Computing (1978)616\u2013625."},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.22.1.70"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.29.4.482"},{"key":"e_1_2_1_22_2","unstructured":"B.Zelinka Medians and peripherians of trees. Arch. Math. (Brno.) (1968)87\u201395."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230260413","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230260413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T16:28:56Z","timestamp":1698251336000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230260413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["10.1002\/net.3230260413"],"URL":"https:\/\/doi.org\/10.1002\/net.3230260413","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}