{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T12:47:59Z","timestamp":1772714879280,"version":"3.50.1"},"reference-count":15,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7710,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1985,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Algorithms of <jats:italic>O(p. n<\/jats:italic>. log <jats:italic>n<\/jats:italic>) time to find an (absolute or vertex) <jats:italic>p<\/jats:italic>\u2010center on a weighted tree of <jats:italic>n<\/jats:italic> vertices are presented. Those algorithms represent improvement over previous known results in the range <jats:italic>p<\/jats:italic> &lt; log <jats:italic>n<\/jats:italic> (for the vertex <jats:italic>p<\/jats:italic>\u2010center problem) and in the range <jats:italic>p<\/jats:italic> &lt; log <jats:italic>n<\/jats:italic>. log log <jats:italic>n<\/jats:italic> (for the absolute <jats:italic>p<\/jats:italic>\u2010center problem).<\/jats:p>","DOI":"10.1002\/net.3230150308","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T19:50:33Z","timestamp":1178913033000},"page":"381-389","source":"Crossref","is-referenced-by-count":24,"title":["Algorithms for finding P\u2010centers on a weighted tree (for relatively small P)"],"prefix":"10.1002","volume":"15","author":[{"given":"M.","family":"Jeger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Kariv","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.1145\/322290.322294"},{"key":"e_1_2_1_2_3","unstructured":"[Also appeared in Proc. of the 7th ICALP Noordwijkerhout (The Netherlands) July1980 pp.64\u201375and"},{"issue":"1","key":"e_1_2_1_2_4","first-page":"27","volume":"2","year":"1982","journal-title":"Quaest. Inf. (S. Africa)"},{"key":"e_1_2_1_2_5","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322236"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/0601043"},{"key":"e_1_2_1_4_2","unstructured":"G. N.Frederickson andD. B.Johnson Optimal algorithms for generating quantile information in X + Y and matrices with sorted columns. Proc. 13th Annual Conference on Information Science and Systems The Johns Hopkins University (1979)47\u201352."},{"key":"e_1_2_1_5_2","unstructured":"G. N.Frederickson andD. B.Johnson Generating and searching sets for path selection andp\u2010center location. Report CS\u201081\u201017 Computer Science Dept. The Pennsylvania State University (August 1981)."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(83)90035-4"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.3.450"},{"key":"e_1_2_1_7_3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.3.462"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1137\/0137040"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/0137041"},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"N.Megiddo On the complexity of linear programming Part 3: Linear\u2010time algorithm for linear programming inR3and related problems. Statistics Department Tel\u2010Aviv University (January1982).","DOI":"10.1109\/SFCS.1982.24"},{"key":"e_1_2_1_11_2","volume-title":"New results on the complexity of p\u2010center problems","author":"Megiddo N.","year":"1982"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1137\/0210023"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230150308","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230150308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T12:55:51Z","timestamp":1697806551000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230150308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["10.1002\/net.3230150308"],"URL":"https:\/\/doi.org\/10.1002\/net.3230150308","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}