{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:15:53Z","timestamp":1748751353043,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319286778"},{"type":"electronic","value":"9783319286785"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-28678-5_12","type":"book-chapter","created":{"date-parts":[[2016,1,8]],"date-time":"2016-01-08T15:14:18Z","timestamp":1452266058000},"page":"164-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Deterministic Algorithm for 1-Median 1-Center Two-Objective Optimization Problem"],"prefix":"10.1007","author":[{"given":"Vahid","family":"Roostapour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iman","family":"Kiarazm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mansoor","family":"Davoodi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,9]]},"reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/S0097539702416402","volume":"33","author":"V Arya","year":"2004","unstructured":"Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM J. Comput. 33(3), 544\u2013562 (2004)","journal-title":"SIAM J. Comput."},{"unstructured":"Badoiu, M., Clarkson, K.L.: Smaller core-sets for balls. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, pp. 801\u2014802 (2003)","key":"12_CR2"},{"doi-asserted-by":"crossref","unstructured":"B\u0101doiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 250\u2013257. ACM (2002)","key":"12_CR3","DOI":"10.1145\/509907.509947"},{"doi-asserted-by":"crossref","unstructured":"Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: Proceedings of 37th Annual Symposium on Foundations of Computer Science, pp. 184\u2013193. IEEE (1996)","key":"12_CR4","DOI":"10.1109\/SFCS.1996.548477"},{"doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S., Tardos, \u00c9., Shmoys, D.B.: A constant-factor approximation algorithm for the k-median problem. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 1\u201310. ACM (1999)","key":"12_CR5","DOI":"10.1145\/301250.301257"},{"issue":"3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jagm.1996.0060","volume":"21","author":"B Chazelle","year":"1996","unstructured":"Chazelle, B., Matou\u0161ek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms 21(3), 579\u2013597 (1996)","journal-title":"J. Algorithms"},{"key":"12_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5184-0","volume-title":"Evolutionary Algorithms for Solving Multi-objective Problems","author":"CAC Coello","year":"2002","unstructured":"Coello, C.A.C., Van Veldhuizen, D.A., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-objective Problems, vol. 242. Springer, Verlag (2002)"},{"key":"12_CR8","volume-title":"Multi-objective Optimization Using Evolutionary Algorithms","author":"K Deb","year":"2001","unstructured":"Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms, vol. 16. Wiley, Chichester (2001)"},{"doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Kushal, A.: Smaller coresets for k-median and k-means clustering. In: Proceedings of the Twenty-First Annual Symposium on Computational Geometry, pp. 126\u2013134. ACM (2005)","key":"12_CR9","DOI":"10.1145\/1064092.1064114"},{"doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Mazumdar, S.: Coresets for $$k$$ k -means and $$k$$ k -median clustering and their applications, pp. 291\u2013300 (2004)","key":"12_CR10","DOI":"10.1145\/1007352.1007400"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"D Hochbaum","year":"1985","unstructured":"Hochbaum, D., Shmoys, D.: A best possible approximation algorithm for the k-center problem. Math. Oper. 10, 180\u2013184 (1985)","journal-title":"Math. Oper."},{"doi-asserted-by":"crossref","unstructured":"Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 731\u2013740. ACM (2002)","key":"12_CR12","DOI":"10.1145\/509907.510012"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N., Supowit, K.J.: On the complexity of some common geometric location problems. SIAM J. Comput. 13(1), 182\u2013196 (1984)","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"12_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/B:MACH.0000033115.78247.f0","volume":"56","author":"A Meyerson","year":"2004","unstructured":"Meyerson, A., O\u2019Callaghan, L., Plotkin, S.: A k-median algorithm with running time independent of data size. Mach. Learn. 56(1\u20133), 61\u201387 (2004)","journal-title":"Mach. Learn."},{"doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proceedings of 41st Annual Symposium on Foundations of Computer Science, pp. 86\u201392. IEEE (2000)","key":"12_CR15","DOI":"10.1109\/SFCS.2000.892068"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-44436-X_4","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"DB Shmoys","year":"2000","unstructured":"Shmoys, D.B.: Approximation algorithms for facility location problems. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 27\u201332. Springer, Heidelberg (2000)"},{"issue":"4","key":"12_CR17","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1287\/mnsc.29.4.482","volume":"29","author":"BC Tansel","year":"1983","unstructured":"Tansel, B.C., Francis, R.L., Lowe, T.J.: State of the artlocation on net- works: a survey. part i: the p-center and p-median problems. Manage. Sci. 29(4), 482\u2013497 (1983)","journal-title":"Manage. Sci."},{"unstructured":"Zarrabi-Zadeh, H., Chan, T.M.: A simple streaming algorithm for minimum enclosing balls. In: CCCG. Citeseer (2006)","key":"12_CR18"},{"unstructured":"Zarrabi-Zadeh, H., Mukhopadhyay, A.: Streaming 1-center with outliers in high dimensions. In: CCCG, pp. 83\u201386 (2009)","key":"12_CR19"}],"container-title":["Lecture Notes in Computer Science","Topics in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28678-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T02:42:38Z","timestamp":1748745758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28678-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319286778","9783319286785"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28678-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 January 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}