{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T00:56:10Z","timestamp":1648947370068},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10479-011-0905-4","type":"journal-article","created":{"date-parts":[[2011,5,31]],"date-time":"2011-05-31T13:52:15Z","timestamp":1306849935000},"page":"23-36","source":"Crossref","is-referenced-by-count":2,"title":["Improved complexity results for several multifacility location problems on trees"],"prefix":"10.1007","volume":"191","author":[{"given":"J\u00f6rg","family":"Kalcsics","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,1]]},"reference":[{"key":"905_CR1","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/7531.7537","volume":"34","author":"R. Cole","year":"1987","unstructured":"Cole, R. (1987). Slowing down sorting networks to obtain faster algorithms. Journal of the ACM, 34, 168\u2013177.","journal-title":"Journal of the ACM"},{"key":"905_CR2","unstructured":"Frederickson, G. (1990). Optimal algorithms for partitioning trees and locating p-centers in trees (Technical report). Department of Computer Science, Purdue University."},{"key":"905_CR3","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0167-6377(91)90041-M","volume":"10","author":"R. Hassin","year":"1991","unstructured":"Hassin, R., & Tamir, A. (1991). Improved complexity bounds for location problems on the real line. Operations Research Letters, 10, 395\u2013402.","journal-title":"Operations Research Letters"},{"key":"905_CR4","volume-title":"Unified approaches to territory design and facility location","author":"J. Kalcsics","year":"2006","unstructured":"Kalcsics, J. (2006). Unified approaches to territory design and facility location. Aachen: Shaker. PhD Thesis."},{"key":"905_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0167-6377(02)00121-9","volume":"30","author":"J. Kalcsics","year":"2002","unstructured":"Kalcsics, J., Nickel, S., Puerto, J., & Tamir, A. (2002). Algorithmic results for ordered median problems. Operations Research Letters, 30, 149\u2013158.","journal-title":"Operations Research Letters"},{"issue":"1","key":"905_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.10053","volume":"41","author":"J. Kalcsics","year":"2003","unstructured":"Kalcsics, J., Nickel, S., & Puerto, J. (2003). Multi-facility ordered median problems: a further analysis. Networks, 41(1), 1\u201312.","journal-title":"Networks"},{"key":"905_CR7","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","volume":"42","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., & Hakimi, S. (1979a). An algorithmic approach to network location problems I: the p-centers. SIAM Journal on Applied Mathematics, 42, 513\u2013538.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"905_CR8","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"42","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., & Hakimi, S. (1979b). An algorithmic approach to network location problems II: the p-medians. SIAM Journal on Applied Mathematics, 42, 539\u2013560.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"905_CR9","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/0212051","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N., & Tamir, A. (1983). New results on the complexity of p-center problems. SIAM Journal on Computing, 12, 751\u2013758.","journal-title":"SIAM Journal on Computing"},{"key":"905_CR10","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/(SICI)1097-0037(199912)34:4<283::AID-NET8>3.0.CO;2-2","volume":"34","author":"S. Nickel","year":"1999","unstructured":"Nickel, S., & Puerto, J. (1999). A unified approach to network location problems. Networks, 34, 283\u2013290.","journal-title":"Networks"},{"key":"905_CR11","volume-title":"Location theory\u2014a unified approach","author":"S. Nickel","year":"2005","unstructured":"Nickel, S., & Puerto, J. (2005). Location theory\u2014a unified approach. Berlin: Springer."},{"key":"905_CR12","first-page":"27","volume":"11","author":"D. P\u00e9rez-Brito","year":"1997","unstructured":"P\u00e9rez-Brito, D., Moreno-P\u00e9rez, J., & Rodr\u00edguez-Mart\u00edn, I. (1997). Finite dominating set for the p-facility cent-dian network location problem. Studies in Locational Analysis, 11, 27\u201340.","journal-title":"Studies in Locational Analysis"},{"issue":"6","key":"905_CR13","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/j.orl.2004.11.005","volume":"33","author":"J. Puerto","year":"2005","unstructured":"Puerto, J., & Rodr\u00edguez-Ch\u00eda, A. (2005). On the exponential cardinality of finite dominating sets for the multifacility ordered median problem. Operations Research Letters, 33(6), 641\u2013651.","journal-title":"Operations Research Letters"},{"key":"905_CR14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A. Tamir","year":"1996","unstructured":"Tamir, A. (1996). An O(pn 2) algorithm for the p-median and related problems on tree graphs. Operations Research Letters, 19, 59\u201364.","journal-title":"Operations Research Letters"},{"key":"905_CR15","first-page":"292","volume":"109","author":"A. Tamir","year":"2000","unstructured":"Tamir, A. (2000). The k-centrum multi-facility location problem. Discrete Applied Mathematics, 109, 292\u2013307.","journal-title":"Discrete Applied Mathematics"},{"key":"905_CR16","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<255::AID-NET2>3.0.CO;2-O","volume":"32","author":"A. Tamir","year":"1998","unstructured":"Tamir, A., P\u00e9rez-Brito, D., & Moreno-P\u00e9rez, J. A. (1998). A polynomial algorithm for the p-centdian problem on a tree. Networks, 32, 255\u2013262.","journal-title":"Networks"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0905-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-0905-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0905-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:08:06Z","timestamp":1559153286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-0905-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["905"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-0905-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,1]]}}}