{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:23Z","timestamp":1725474983591},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_39","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T00:57:35Z","timestamp":1164761855000},"page":"379-388","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Algorithms for the Path\/Tree-Shaped Facility Location Problems in Trees"],"prefix":"10.1007","author":[{"given":"Binay","family":"Bhattacharya","sequence":"first","affiliation":[]},{"given":"Yuzhuang","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Qiaosheng","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Arie","family":"Tamir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11682462_19","volume-title":"LATIN 2006: Theoretical Informatics","author":"B. Ben-Moshe","year":"2006","unstructured":"Ben-Moshe, B., Bhattacharya, B., Shi, Q.: An optimal algorithm for the continuous\/discrete weighted 2-center problem in trees. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, Springer, Heidelberg (2006)"},{"volume-title":"Optimal algorithms for weighted p-center problem in trees","year":"2006","author":"B. Bhattacharya","key":"39_CR2","unstructured":"Bhattacharya, B., Shi, Q.: Optimal algorithms for weighted p-center problem in trees, any fixed p (manuscript, 2006)"},{"key":"39_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BFb0028271","volume-title":"Algorithms and Data Structures","author":"G.N. Frederickson","year":"1991","unstructured":"Frederickson, G.N.: Parametric search and locating supply centers in trees. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol.\u00a0519, pp. 299\u2013319. Springer, Heidelberg (1991)"},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0196-6774(83)90035-4","volume":"4","author":"G.N. Frederickson","year":"1983","unstructured":"Frederickson, G.N., Johnson, D.B.: Finding k-th paths and p-centers by generating and searching good data structures. J. of Alg.\u00a04, 61\u201380 (1983)","journal-title":"J. of Alg."},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"S.L. Hakimi","year":"1964","unstructured":"Hakimi, S.L.: Optimum location of switching centers and the absolute centers and medians of a graph. Oper. Res.\u00a012, 450\u2013459 (1964)","journal-title":"Oper. Res."},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1002\/net.3230230605","volume":"23","author":"S.L. Hakimi","year":"1993","unstructured":"Hakimi, S.L., Schmeichel, E.F., Labbe, M.: On locating path or tree shaped facilities on networks. Networks\u00a023, 543\u2013555 (1993)","journal-title":"Networks"},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1287\/trsc.15.2.98","volume":"15","author":"S.M. Hedetniemi","year":"1981","unstructured":"Hedetniemi, S.M., Cockaine, E.J., Hedetniemi, S.T.: Linear algorithms for finding the Jordan center and path center of a tree. Transport. Sci.\u00a015, 98\u2013114 (1981)","journal-title":"Transport. Sci."},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1002\/net.3230150308","volume":"15","author":"M. Jeger","year":"1985","unstructured":"Jeger, M., Kariv, O.: Algorithms for finding p-centers on a weighted tree (for relatively small p). Networks\u00a015, 381\u2013389 (1985)","journal-title":"Networks"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in R\n 3 and related problems. SIAM J. Comput.\u00a012, 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"key":"39_CR10","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1137\/0210023","volume":"10","author":"N. Megiddo","year":"1981","unstructured":"Megiddo, N., Tamir, A., Zemel, E., Chandrasekaran, R.: An O(nlog2\n n) algorithm for the kth longest path in a tree with applications to location problems. SIAM J. Comput.\u00a010, 328\u2013337 (1981)","journal-title":"SIAM J. Comput."},{"key":"39_CR11","unstructured":"Mesa, J.A.: The conditional path center problem in tree graphs, unpublished paper presented to EWGLA8 held in Lambrecht (Germany) (1995)"},{"key":"39_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/net.3230100307","volume":"10","author":"E. Minieka","year":"1980","unstructured":"Minieka, E.: Conditional centers and medians on a graph. Networks\u00a010, 265\u2013272 (1980)","journal-title":"Networks"},{"key":"39_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/net.3230150304","volume":"15","author":"E. Minieka","year":"1985","unstructured":"Minieka, E.: The optimal location of a path or tree in a tree network. Networks\u00a015, 309\u2013321 (1985)","journal-title":"Networks"},{"key":"39_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1002\/(SICI)1097-0037(199703)29:2<107::AID-NET4>3.0.CO;2-N","volume":"29","author":"A. Shioura","year":"1997","unstructured":"Shioura, A., Shigeno, M.: The tree center problems and the relationship with the bottleneck knapsack problems. Networks\u00a029, 107\u2013110 (1997)","journal-title":"Networks"},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0166-218X(01)00199-8","volume":"118","author":"A. Tamir","year":"2002","unstructured":"Tamir, A., Puerto, J., P\u00e9rez-Brito, D.: The centdian subtree on tree networks. Disc. Appl. Math.\u00a0118, 263\u2013278 (2002)","journal-title":"Disc. Appl. Math."},{"key":"39_CR16","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jalgor.2005.01.005","volume":"56","author":"A. Tamir","year":"2005","unstructured":"Tamir, A., Puerto, J., Mesa, J.A., Rodriguez-Chia, A.M.: Conditional location of path and tree shaped facilities on trees. J. of Alg.\u00a056, 50\u201375 (2005)","journal-title":"J. of Alg."},{"key":"39_CR17","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1006\/jagm.1999.1020","volume":"34","author":"B.F. Wang","year":"2000","unstructured":"Wang, B.F.: Efficient parallel algorithms for optimally locating a path and a tree of a specified length in a weighted tree network. J. of Alg.\u00a034, 90\u2013108 (2000)","journal-title":"J. of Alg."},{"key":"39_CR18","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(84)90014-0","volume":"18","author":"E. Zemel","year":"1984","unstructured":"Zemel, E.: An O(n) algorithm for the linear multiple choice knapsack problem and related problems. Information Processing Letters\u00a018, 123\u2013128 (1984)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:49:55Z","timestamp":1619495395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11940128_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}