{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T16:38:22Z","timestamp":1776875902732,"version":"3.51.2"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031206238","type":"print"},{"value":"9783031206245","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20624-5_14","type":"book-chapter","created":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T15:18:05Z","timestamp":1666970285000},"page":"222-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Obtaining Approximately Optimal and\u00a0Diverse Solutions via\u00a0Dispersion"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5083-6082","authenticated-orcid":false,"given":"Jie","family":"Gao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2111-3210","authenticated-orcid":false,"given":"Mayank","family":"Goswami","sequence":"additional","affiliation":[]},{"given":"C. S.","family":"Karthik","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2243-8666","authenticated-orcid":false,"given":"Meng-Tsung","family":"Tsai","sequence":"additional","affiliation":[]},{"given":"Shih-Yu","family":"Tsai","sequence":"additional","affiliation":[]},{"given":"Hao-Tsung","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,29]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Abbar, S., Amer-Yahia, S., Indyk, P., Mahabadi, S., Varadarajan, K.R.: Diverse near neighbor problem. In: Symposium on Computational Geometry (SoCG), pp. 207\u2013214. ACM (2013)","DOI":"10.1145\/2462356.2462401"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s00453-006-0068-x","volume":"46","author":"A Armon","year":"2006","unstructured":"Armon, A., Zwick, U.: Multicriteria global minimum cuts. Algorithmica 46(1), 15\u201326 (2006)","journal-title":"Algorithmica"},{"key":"14_CR3","doi-asserted-by":"publisher","DOI":"10.5555\/554706","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G Ausiello","year":"1999","unstructured":"Ausiello, G., Marchetti-Spaccamela, A., Crescenzi, P., Gambosi, G., Protasi, M., Kann, V.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999). https:\/\/doi.org\/10.5555\/554706"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Baste, J., et al.: Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory. Artif. Intell. 303, 103644 (2022)","DOI":"10.1016\/j.artint.2021.103644"},{"issue":"12","key":"14_CR5","doi-asserted-by":"publisher","first-page":"254","DOI":"10.3390\/a12120254","volume":"12","author":"J Baste","year":"2019","unstructured":"Baste, J., Jaffke, L., Masa\u0159\u00edk, T., Philip, G., Rote, G.: FPT algorithms for diverse collections of hitting sets. Algorithms 12(12), 254 (2019)","journal-title":"Algorithms"},{"issue":"1\u20132","key":"14_CR6","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10107-009-0307-4","volume":"128","author":"A Berger","year":"2011","unstructured":"Berger, A., Bonifaci, V., Grandoni, F., Sch\u00e4fer, G.: Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Math. Program. 128(1\u20132), 355\u2013372 (2011)","journal-title":"Math. Program."},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/s00453-007-9142-2","volume":"55","author":"BE Birnbaum","year":"2009","unstructured":"Birnbaum, B.E., Goldman, K.J.: An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs. Algorithmica 55(1), 42\u201359 (2009)","journal-title":"Algorithmica"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Borodin, A., Jain, A., Lee, H.C., Ye, Y.: Max-sum diversification, monotone submodular functions, and dynamic updates. ACM Trans. Algorithms 13(3), 41:1\u201341:25 (2017)","DOI":"10.1145\/3086464"},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/0196-6774(92)90018-8","volume":"13","author":"PM Camerini","year":"1992","unstructured":"Camerini, P.M., Galbiati, G., Maffioli, F.: Random pseudo-polynomial algorithms for exact matroid problems. J. Algorithms 13(2), 258\u2013273 (1992)","journal-title":"J. Algorithms"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Cevallos, A., Eisenbrand, F., Zenklusen, R.: Max-sum diversity via convex programming. In: Fekete, S.P., Lubiw, A. (eds.) 32nd International Symposium on Computational Geometry, SoCG 2016, 14\u201318 June 2016, Boston, MA, USA. LIPIcs, vol. 51, pp. 26:1\u201326:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)","DOI":"10.1016\/j.comgeo.2015.10.003"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Cevallos, A., Eisenbrand, F., Zenklusen, R.: Local search for max-sum diversification. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 130\u2013142. SIAM (2017)","DOI":"10.1137\/1.9781611974782.9"},{"key":"14_CR12","series-title":"Mathematical Programming Studies","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BFb0120910","volume-title":"Combinatorial Optimization II","author":"J Clausen","year":"1980","unstructured":"Clausen, J., Hansen, L.A.: Finding k edge-disjoint spanning trees of minimum total weight in a network: an application of matroid theory. In: Rayward-Smith, V.J. (ed.) Combinatorial Optimization II. Mathematical Programming Studies, vol. 13, pp. 88\u2013101. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/BFb0120910"},{"issue":"4","key":"14_CR13","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10878-007-9071-7","volume":"14","author":"CW Commander","year":"2007","unstructured":"Commander, C.W., Pardalos, P.M., Ryabchenko, V., Uryasev, S., Zrazhevsky, G.: The wireless network jamming problem. J. Comb. Optim. 14(4), 481\u2013498 (2007)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"14_CR14","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1137\/080724514","volume":"39","author":"I Diakonikolas","year":"2010","unstructured":"Diakonikolas, I., Yannakakis, M.: Small approximate pareto sets for biobjective shortest paths and other problems. SIAM J. Comput. 39(4), 1340\u20131371 (2010)","journal-title":"SIAM J. Comput."},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Erkut, E.: The discrete P-dispersion problem. Eur. J. Oper. Res. 46(1), 48\u201360 (1990). https:\/\/doi.org\/10.1016\/0377-2217(90)90297-O, https:\/\/www.sciencedirect.com\/science\/article\/pii\/037722179090297O","DOI":"10.1016\/0377-2217(90)90297-O"},{"key":"14_CR16","unstructured":"Fomin, F.V., Golovach, P.A., Jaffke, L., Philip, G., Sagunov, D.: Diverse pairs of matchings. In: 31st International Symposium on Algorithms and Computation (ISAAC). LIPIcs, vol. 181, pp. 26:1\u201326:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"14_CR17","unstructured":"Fomin, F.V., Golovach, P.A., Panolan, F., Philip, G., Saurabh, S.: Diverse collections in matroids and graphs. In: Bl\u00e4ser, M., Monmege, B. (eds.) 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, 16\u201319 March 2021, Saarbr\u00fccken, Germany (Virtual Conference). LIPIcs, vol. 187, pp. 31:1\u201331:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"issue":"1","key":"14_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1137\/0206011","volume":"6","author":"HN Gabow","year":"1977","unstructured":"Gabow, H.N.: Two algorithms for generating weighted spanning trees in order. SIAM J. Comput. 6(1), 139\u2013150 (1977)","journal-title":"SIAM J. Comput."},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Gao, J., Goswami, M., Karthik, C.S., Tsai, M.T., Tsai, S.Y., Yang, H.T.: Obtaining approximately optimal and diverse solutions via dispersion (2022). https:\/\/doi.org\/10.48550\/ARXIV.2202.10028, https:\/\/arxiv.org\/abs\/2202.10028","DOI":"10.48550\/ARXIV.2202.10028"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Goldenberg, E., Karthik C. S.: Hardness amplification of optimization problems. In: Vidick, T. (ed.) 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, 12\u201314 January 2020, Seattle, Washington, USA. LIPIcs, vol. 151, pp. 1:1\u20131:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2020.1","DOI":"10.4230\/LIPIcs.ITCS.2020.1"},{"key":"14_CR21","unstructured":"Hanaka, T., Kiyomi, M., Kobayashi, Y., Kobayashi, Y., Kurita, K., Otachi, Y.: A framework to design approximation algorithms for finding diverse solutions in combinatorial problems. CoRR abs\/2201.08940 (2022)"},{"key":"14_CR22","unstructured":"Hanaka, T., Kobayashi, Y., Kurita, K., Lee, S.W., Otachi, Y.: Computing diverse shortest paths efficiently: a theoretical and experimental study. CoRR abs\/2112.05403 (2021)"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Hanaka, T., Kobayashi, Y., Kurita, K., Otachi, Y.: Finding diverse trees, paths, and more. In: Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI), pp. 3778\u20133786. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i5.16495"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Hara, S., Maehara, T.: Enumerate lasso solutions for feature selection. In: Singh, S.P., Markovitch, S. (eds.) Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI), pp. 1985\u20131991. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.10793"},{"issue":"3","key":"14_CR25","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(3), 133\u2013137 (1997)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"14_CR26","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10898-020-00951-7","volume":"80","author":"A Herzel","year":"2021","unstructured":"Herzel, A., Bazgan, C., Ruzika, S., Thielen, C., Vanderpooten, D.: One-exact approximate pareto sets. J. Global Optim. 80(1), 87\u2013115 (2021)","journal-title":"J. Global Optim."},{"issue":"4","key":"14_CR27","first-page":"1284","volume":"33","author":"A Herzel","year":"2021","unstructured":"Herzel, A., Ruzika, S., Thielen, C.: Approximation methods for multiobjective optimization problems: a survey. INFORMS J. Comput. 33(4), 1284\u20131299 (2021)","journal-title":"INFORMS J. Comput."},{"key":"14_CR28","series-title":"NATO Advanced Study Institutes Series","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-94-011-7557-9_8","volume-title":"Combinatorial Programming: Methods and Applications","author":"J Krarup","year":"1995","unstructured":"Krarup, J.: The peripatetic salesman and some related unsolved problems. In: Roy, B. (ed.) Combinatorial Programming: Methods and Applications. NATO Advanced Study Institutes Series, vol. 19, pp. 173\u2013178. Springer, Dordrecht (1995). https:\/\/doi.org\/10.1007\/978-94-011-7557-9_8"},{"issue":"4","key":"14_CR29","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1111\/j.1538-4632.1987.tb00133.x","volume":"19","author":"M Kuby","year":"1987","unstructured":"Kuby, M.: Programming models for facility dispersion: the P-dispersion and maxisum dispersion problems. Geogr. Anal. 19(4), 315\u2013329 (1987). https:\/\/doi.org\/10.1111\/j.1538-4632.1987.tb00133.x","journal-title":"Geogr. Anal."},{"issue":"7","key":"14_CR30","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"EL Lawler","year":"1972","unstructured":"Lawler, E.L.: A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Manage. Sci. 18(7), 401\u2013405 (1972)","journal-title":"Manage. Sci."},{"key":"14_CR31","unstructured":"Lindgren, E.M., Dimakis, A.G., Klivans, A.: Exact map inference by avoiding fractional vertices. In: International Conference on Machine Learning, pp. 2120\u20132129. PMLR (2017)"},{"issue":"1","key":"14_CR32","first-page":"105","volume":"7","author":"K Mulmuley","year":"1987","unstructured":"Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. Comb. 7(1), 105\u2013113 (1987)","journal-title":"Comb."},{"issue":"3","key":"14_CR33","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1287\/opre.16.3.682","volume":"16","author":"KG Murty","year":"1968","unstructured":"Murty, K.G.: An algorithm for ranking all the assignments in order of increasing cost. Oper. Res. 16(3), 682\u2013687 (1968)","journal-title":"Oper. Res."},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Namorado Climaco, J.C., Queir\u00f3s Vieira Martins, E.: A bicriterion shortest path algorithm. Eur. J. Oper. Res. 11(4), 399\u2013404 (1982)","DOI":"10.1016\/0377-2217(82)90205-3"},{"key":"14_CR35","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 86\u201392. IEEE (2000)"},{"key":"14_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-61422-2_121","volume-title":"Algorithm Theory \u2014 SWAT\u201996","author":"R Ravi","year":"1996","unstructured":"Ravi, R., Goemans, M.X.: The constrained minimum spanning tree problem. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol. 1097, pp. 66\u201375. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61422-2_121"},{"issue":"2","key":"14_CR37","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(2), 299\u2013310 (1994)","journal-title":"Oper. Res."},{"key":"14_CR38","doi-asserted-by":"publisher","unstructured":"Wang, D., Kuo, Y.S.: A study on two geometric location problems. Inf. Process. Lett. 28(6), 281\u2013286 (1988) https:\/\/doi.org\/10.1016\/0020-0190(88)90174-3, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0020019088901743","DOI":"10.1016\/0020-0190(88)90174-3"},{"key":"14_CR39","unstructured":"Yang, H.T., Tsai, S.Y., Liu, K.S., Lin, S., Gao, J.: Patrol scheduling against adversaries with varying attack durations. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, pp. 1179\u20131188 (2019)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2022: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20624-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T23:05:12Z","timestamp":1667084712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20624-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206238","9783031206245"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20624-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guanajuato","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/delta.cs.cinvestav.mx\/~francisco\/Latin22\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"114","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}