{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:56Z","timestamp":1759637996404},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642352607"},{"type":"electronic","value":"9783642352614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35261-4_60","type":"book-chapter","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T01:59:41Z","timestamp":1355450381000},"page":"578-587","source":"Crossref","is-referenced-by-count":1,"title":["The Multi-Service Center Problem"],"prefix":"10.1007","author":[{"given":"Hung-I","family":"Yu","sequence":"first","affiliation":[]},{"given":"Cheng-Chung","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"60_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","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, pp. 166\u2013177. Springer, Heidelberg (2006)"},{"key":"60_CR2","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1145\/7531.7537","volume":"34","author":"R. Cole","year":"1987","unstructured":"Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM\u00a034, 200\u2013208 (1987)","journal-title":"J. ACM"},{"key":"60_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. Frederickson","year":"1991","unstructured":"Frederickson, G.: 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), 10.1007\/BFb0028271"},{"key":"60_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)"},{"issue":"3","key":"60_CR5","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. I: The p-centers. SIAM Journal on Applied Mathematics\u00a037(3), 513\u2013538 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"4","key":"60_CR6","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 3 and related problems. SIAM Journal on Computing\u00a012(4), 759\u2013776 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"60_CR7","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N. Megiddo","year":"1984","unstructured":"Megiddo, N.: Linear programming in linear time when the dimension is fixed. J. ACM\u00a031, 114\u2013127 (1984)","journal-title":"J. ACM"},{"key":"60_CR8","doi-asserted-by":"crossref","first-page":"445","DOI":"10.21136\/AM.1980.103883","volume":"25","author":"J. Plesn\u00edk","year":"1980","unstructured":"Plesn\u00edk, J.: On the computational complexity of centers locating in a graph. Apl. Mat.\u00a025, 445\u2013452 (1980)","journal-title":"Apl. Mat."},{"issue":"3","key":"60_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0166-218X(87)90029-1","volume":"17","author":"J. Plesn\u00edk","year":"1987","unstructured":"Plesn\u00edk, J.: A heuristic for the p-center problems in graphs. Discrete Applied Mathematics\u00a017(3), 263\u2013268 (1987)","journal-title":"Discrete Applied Mathematics"}],"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-35261-4_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T09:35:12Z","timestamp":1714728912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35261-4_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642352607","9783642352614"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35261-4_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}