{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:04Z","timestamp":1759063504346},"reference-count":4,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5123,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1992,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Minieka and Hakimi et al. considered the problem of locating a tree\u2010shaped facility of a given length in a tree network, with the objective of maximizing the sum of node distances from this facility. They stated the complexity of the model as an open problem. We prove that it is NP\u2010complete and provide a pseudopolynomial time algorithm.<\/jats:p>","DOI":"10.1002\/net.3230220602","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T13:17:42Z","timestamp":1178975862000},"page":"515-522","source":"Crossref","is-referenced-by-count":6,"title":["On a tree\u2010shaped facility location problem of Minieka"],"prefix":"10.1002","volume":"22","author":[{"given":"Ramon","family":"Rabinovitch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arie","family":"Tamir","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","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1974"},{"key":"e_1_2_1_3_2","unstructured":"S. L.Hakimi E. F.Schmeichel andM.Labbe On locating path or tree\u2010shaped facilities on networks.Networks to appear."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/0210023"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150304"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230220602","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230220602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T03:56:06Z","timestamp":1698119766000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230220602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":4,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["10.1002\/net.3230220602"],"URL":"https:\/\/doi.org\/10.1002\/net.3230220602","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}