{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T23:59:34Z","timestamp":1740095974712,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175169"},{"type":"electronic","value":"9783642175176"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17517-6_39","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:13:41Z","timestamp":1291389221000},"page":"440-450","source":"Crossref","is-referenced-by-count":1,"title":["An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Spoerhase","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"39_CR1","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1137\/S0097539797329397","volume":"31","author":"A.M. Ben-Amram","year":"2001","unstructured":"Ben-Amram, A.M., Galil, Z.: Topological lower bounds on algebraic random access machines. SIAM Journal on Computing\u00a031(3), 722\u2013761 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"39_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/11561071_26","volume-title":"Algorithms \u2013 ESA 2005","author":"R. Benkoczi","year":"2005","unstructured":"Benkoczi, R., Bhattacharya, B.K.: A new template for solving p-median problems for trees in sub-quadratic time. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 271\u2013282. Springer, Heidelberg (2005)"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"A.J. Goldman","year":"1971","unstructured":"Goldman, A.J.: Optimal center location in simple networks. Transportation Science\u00a05, 212\u2013221 (1971)","journal-title":"Transportation Science"},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0377-2217(83)90180-7","volume":"12","author":"S.L. Hakimi","year":"1983","unstructured":"Hakimi, S.L.: On locating new facilities in a competitive environment. European Journal of Operational Research\u00a012, 29\u201335 (1983)","journal-title":"European Journal of Operational Research"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1287\/trsc.7.3.287","volume":"7","author":"G.Y. Handler","year":"1973","unstructured":"Handler, G.Y.: Minimax location of a facility in an undirected tree graph. Transportation Science\u00a07, 287\u2013293 (1973)","journal-title":"Transportation Science"},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0020-0190(75)90055-1","volume":"4","author":"A.N.C. Kang","year":"1975","unstructured":"Kang, A.N.C., Ault, D.A.: Some properties of a free centroid of a free tree. Information Processing Letters\u00a04, 18\u201320 (1975)","journal-title":"Information Processing Letters"},{"issue":"3","key":"39_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<167::AID-NET5>3.0.CO;2-L","volume":"28","author":"T.U. Kim","year":"1996","unstructured":"Kim, T.U., Lowe, T.J., Tamir, A., Ward, J.E.: On the location of a tree-shaped facility. Networks\u00a028(3), 167\u2013175 (1996)","journal-title":"Networks"},{"key":"39_CR8","unstructured":"Lazar, A., Tamir, A.: Improved algorithms for some competitive location centroid problems on paths, trees and graphs. Tech. rep., Tel Aviv University (submitted, 2010)"},{"issue":"2","key":"39_CR9","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1137\/0604028","volume":"4","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N., Zemel, E., Hakimi, S.: The maximum coverage location problem. SIAM Journal on Algebraic and Discrete Methods\u00a04(2), 253\u2013261 (1983)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"2","key":"39_CR10","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.ejor.2006.06.039","volume":"181","author":"H. Noltemeier","year":"2007","unstructured":"Noltemeier, H., Spoerhase, J., Wirth, H.C.: Multiple voting location and single voting location on trees. European Journal of Operational Research\u00a0181(2), 654\u2013667 (2007), \n                    \n                      http:\/\/dx.doi.org\/10.1016\/j.ejor.2006.06.039","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"39_CR11","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.ipl.2008.12.009","volume":"109","author":"J. Spoerhase","year":"2009","unstructured":"Spoerhase, J., Wirth, H.C.: An O(n (logn)2\/loglog\n                  n) algorithm for the single maximum coverage location or the (1,X\n                  \n                    p\n                  )-medianoid problem on trees. Information Processing Letters\u00a0109(8), 391\u2013394 (2009), \n                    \n                      http:\/\/dx.doi.org\/10.1016\/j.ipl.2008.12.009","journal-title":"Information Processing Letters"},{"issue":"2","key":"39_CR12","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.jda.2009.02.004","volume":"7","author":"J. Spoerhase","year":"2009","unstructured":"Spoerhase, J., Wirth, H.C.: Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree. Journal of Discrete Algorithms\u00a07(2), 256\u2013266 (2009), \n                    \n                      http:\/\/dx.doi.org\/10.1016\/j.jda.2009.02.004","journal-title":"Journal of Discrete Algorithms"},{"issue":"47-49","key":"39_CR13","doi-asserted-by":"publisher","first-page":"5128","DOI":"10.1016\/j.tcs.2009.08.020","volume":"410","author":"J. Spoerhase","year":"2009","unstructured":"Spoerhase, J., Wirth, H.C.: (r,p)-centroid problems on paths and trees. Theoretical Computer Science\u00a0410(47-49), 5128\u20135137 (2009), \n                    \n                      http:\/\/dx.doi.org\/10.1016\/j.tcs.2009.08.020","journal-title":"Theoretical Computer Science"},{"key":"39_CR14","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.dam.2009.05.006","volume":"158","author":"J. Spoerhase","year":"2010","unstructured":"Spoerhase, J., Wirth, H.C.: Relaxed voting and competitive location under monotonous gain functions on trees. Discrete Applied Mathematics\u00a0158, 361\u2013373 (2010), \n                    \n                      http:\/\/dx.doi.org\/10.1016\/j.dam.2009.05.006","journal-title":"Discrete Applied Mathematics"},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A. Tamir","year":"1996","unstructured":"Tamir, A.: An O(pn\n                  2) algorithm for the p-median and related problems on tree graphs. Operations Research Letters\u00a019, 59\u201364 (1996)","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17517-6_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T13:17:47Z","timestamp":1553260667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17517-6_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175169","9783642175176"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17517-6_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}