{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:27:16Z","timestamp":1725575236920},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540258636"},{"type":"electronic","value":"9783540323099"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11424925_69","type":"book-chapter","created":{"date-parts":[[2011,1,15]],"date-time":"2011-01-15T11:14:27Z","timestamp":1295090067000},"page":"652-661","source":"Crossref","is-referenced-by-count":0,"title":["Regrouping Service Sites: A Genetic Approach Using a Voronoi Diagram"],"prefix":"10.1007","author":[{"given":"Jeong-Yeon","family":"Seo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Min","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seoung Soo","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deok-Soo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"69_CR1","first-page":"106","volume-title":"Proceedings of the 30th Annual ACM Symposium on Theory of Computing","author":"S. Arora","year":"1998","unstructured":"Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean k-medians and related problems. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 106\u2013113. ACM, New York (1998)"},{"key":"69_CR2","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1016\/S0305-0548(03)00093-5","volume":"31","author":"N. Mansour","year":"2004","unstructured":"Mansour, N., Tabbara, H., Dana, T.: A genetic algorithm approach for regrouping service sites. Computers & Operations Research\u00a031, 1317\u20131333 (2004)","journal-title":"Computers & Operations Research"},{"key":"69_CR3","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. Freeman and Co., New York (1979)"},{"key":"69_CR4","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Berlin (2001)"},{"key":"69_CR5","doi-asserted-by":"publisher","DOI":"10.1201\/9781420050073","volume-title":"Practical handbook of genetic algorithms","author":"L.D. Chambers","year":"1995","unstructured":"Chambers, L.D.: Practical handbook of genetic algorithms, vol.\u00a0I and II. CRC Press, Boca Raton (1995)"},{"key":"69_CR6","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading (1989)"},{"key":"69_CR7","volume-title":"Adaptation In Natural and Artificial Systems","author":"J. Holland","year":"1975","unstructured":"Holland, J.: Adaptation In Natural and Artificial Systems. The University of Michigan Press, Ann Arbour (1975)"},{"key":"69_CR8","volume-title":"Spatial Tessellations Concetps and Applications of Voronoi Diagrams","author":"A. Okabe","year":"1992","unstructured":"Okabe, A., Boots, B., Sugihara, K.: Spatial Tessellations Concetps and Applications of Voronoi Diagrams. John Wiley & Sons, Chichester (1992)"},{"key":"69_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Computing Surveys\u00a023, 345\u2013405 (1991)","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"69_CR10","first-page":"150","volume":"3","author":"D.S. Kim","year":"2002","unstructured":"Kim, D.S., Chung, Y.C., Kim, J.J., Kim, D., Yu, K.: Voronoi diagram as an analysis tool for spatial properties for ceramics. Journal of Ceramic Processing Research, Part II\u00a03(3), 150\u2013152 (2002)","journal-title":"Journal of Ceramic Processing Research"},{"key":"69_CR11","unstructured":"Seo, D.I., Moon, B.R.: Voronoi Quantized Crossover for Traveling Salesman Problem. In: Genetic and Evolutionary Computation Conference, pp. 544\u2013552 (2002)"},{"issue":"7","key":"69_CR12","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1109\/12.508322","volume":"45","author":"T.N. Bui","year":"1996","unstructured":"Bui, T.N., Moon, B.R.: Genetic algorithm and Graph partitioning. IEEE Transactions on computers\u00a045(7), 841\u2013855 (1996)","journal-title":"IEEE Transactions on computers"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11424925_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:06:19Z","timestamp":1619492779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11424925_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258636","9783540323099"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11424925_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}