{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:34:21Z","timestamp":1767339261480,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046507"},{"type":"electronic","value":"9783030046514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_45","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"672-678","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Max-Min Dispersion on a Line"],"prefix":"10.1007","author":[{"given":"Tetsuya","family":"Araki","sequence":"first","affiliation":[]},{"given":"Shin-ichi","family":"Nakano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"45_CR1","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/299917.299918","volume":"30","author":"P Agarwal","year":"1998","unstructured":"Agarwal, P., Sharir, M.: Efficient algorithms for geometric optimization. Comput. Surv. 30, 412\u2013458 (1998)","journal-title":"Comput. Surv."},{"key":"45_CR2","unstructured":"Akagi, T., Nakano, S.: Dispersion on the line. IPSJ SIG Technical reports, 2016-AL-158-3 (2016)"},{"key":"45_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-319-78455-7_20","volume-title":"Frontiers in Algorithmics","author":"T Akagi","year":"2018","unstructured":"Akagi, T., et al.: Exact algorithms for the max-min dispersion problem. In: Chen, J., Lu, P. (eds.) FAW 2018. LNCS, vol. 10823, pp. 263\u2013272. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78455-7_20"},{"key":"45_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BFb0053964","volume-title":"Approximation Algorithms for Combinatiorial Optimization","author":"C Baur","year":"1998","unstructured":"Baur, C., Fekete, S.P.: Approximation of geometric dispersion problems. In: Jansen, K., Rolim, J. (eds.) APPROX 1998. LNCS, vol. 1444, pp. 63\u201375. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0053964"},{"key":"45_CR5","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/s00453-007-9142-2","volume":"50","author":"B Birnbaum","year":"2009","unstructured":"Birnbaum, B., Goldman, K.J.: An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs. Algorithmica 50, 42\u201359 (2009)","journal-title":"Algorithmica"},{"key":"45_CR6","unstructured":"Cevallos, A., Eisenbrand, F., Zenklusen, R.: Max-sum diversity via convex programming. In: Proceedings of SoCG 2016, pp. 26:1\u201326:14 (2016)"},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"Cevallos, A., Eisenbrand, F., Zenklusen, R.: Local search for max-sum diversification. In: Proceedings of SODA 2017, pp. 130\u2013142 (2017)","DOI":"10.1137\/1.9781611974782.9"},{"key":"45_CR8","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1006\/jagm.2000.1145","volume":"38","author":"B Chandra","year":"2001","unstructured":"Chandra, B., Halldorsson, M.M.: Approximation algorithms for dispersion problems. J. Algorithms 38, 438\u2013465 (2001)","journal-title":"J. Algorithms"},{"volume-title":"Facility Location: A Survey of Applications and Methods","year":"1995","key":"45_CR9","unstructured":"Drezner, Z. (ed.): Facility Location: A Survey of Applications and Methods. Springer, New York (1995)"},{"volume-title":"Facility Location: Applications and Theory","year":"2002","key":"45_CR10","unstructured":"Drezner, Z., Hamacher, H.W. (eds.): Facility Location: Applications and Theory. Springer, Heidelberg (2002)"},{"key":"45_CR11","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0377-2217(90)90297-O","volume":"46","author":"E Erkut","year":"1990","unstructured":"Erkut, E.: The discrete $$p$$-dispersion problem. Eur. J. Oper. Res. 46, 48\u201360 (1990)","journal-title":"Eur. J. Oper. Res."},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s00453-003-1074-x","volume":"38","author":"SP Fekete","year":"2004","unstructured":"Fekete, S.P., Meijer, H.: Maximum dispersion and geometric maximum weight cliques. Algorithmica 38, 501\u2013511 (2004)","journal-title":"Algorithmica"},{"key":"45_CR13","unstructured":"Frederickson, G.: Optimal algorithms for tree partitioning. In: Proceedings of SODA 1991, pp. 168\u2013177 (1991)"},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0167-6377(97)00034-5","volume":"21","author":"R Hassin","year":"1997","unstructured":"Hassin, R., Rubinstein, S., Tamir, A.: Approximation algorithms for maximum dispersion. Oper. Res. Lett. 21, 133\u2013137 (1997)","journal-title":"Oper. Res. Lett."},{"key":"45_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1287\/opre.42.2.299","volume":"42","author":"SS Ravi","year":"1994","unstructured":"Ravi, S.S., Rosenkrantz, D.J., Tayi, G.K.: Heuristic and special case algorithms for dispersion problems. Oper. Res. 42, 299\u2013310 (1994)","journal-title":"Oper. Res."},{"key":"45_CR16","first-page":"241","volume":"42","author":"M Sydow","year":"2014","unstructured":"Sydow, M.: Approximation guarantees for max sum and max min facility dispersion with parameterised triangle inequality and applications in result diversification. Mathematica Applicanda 42, 241\u2013257 (2014)","journal-title":"Mathematica Applicanda"},{"key":"45_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/BFb0045097","volume-title":"Computing and Combinatorics","author":"K-H Tsai","year":"1997","unstructured":"Tsai, K.-H., Wang, D.-W.: Optimal algorithms for circle partitioning. In: Jiang, T., Lee, D.T. (eds.) COCOON 1997. LNCS, vol. 1276, pp. 304\u2013310. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0045097"},{"key":"45_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0020-0190(88)90174-3","volume":"28","author":"DW Wang","year":"1988","unstructured":"Wang, D.W., Kuo, Y.-S.: A study on two geometric location problems. Inf. Process. Lett. 28, 281\u2013286 (1988)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:52:03Z","timestamp":1710345123000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}