{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:35:23Z","timestamp":1774334123887,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_27","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:10Z","timestamp":1770977230000},"page":"402-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Disjoint Tours and\u00a0the\u00a0Price of\u00a0Diversity"],"prefix":"10.1007","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9s L\u00f3pez","family":"Mart\u00ednez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Ageev, A.A., Pyatkin, A.V.: A 2-approximation algorithm for the metric 2-peripatetic salesman problem. In: International Workshop on Approximation and Online Algorithms, pp. 103\u2013115. Springer (2007)","DOI":"10.1007\/978-3-540-77918-6_9"},{"issue":"1","key":"27_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/ijoc.2022.0164","volume":"36","author":"I Ahanor","year":"2024","unstructured":"Ahanor, I., Medal, H., Trapp, A.C.: Diversitree: a new method to efficiently compute diverse sets of near-optimal solutions to mixed-integer optimization problems. INFORMS J. Comput. 36(1), 61\u201377 (2024)","journal-title":"INFORMS J. Comput."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Ahmed, F., Dickerson, J.P., Fuge, M.: Diverse weighted bipartite b-matching. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI-17, pp. 35\u201341 (2017)","DOI":"10.24963\/ijcai.2017\/6"},{"issue":"52","key":"27_CR4","first-page":"7","volume":"52","author":"B Alspach","year":"2008","unstructured":"Alspach, B.: The wonderful Walecki construction. Bull. Inst. Combin. Appl. 52(52), 7\u201320 (2008)","journal-title":"Bull. Inst. Combin. Appl."},{"issue":"12","key":"27_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":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3411513","volume":"8","author":"N Benabbou","year":"2020","unstructured":"Benabbou, N., Chakraborty, M., Ho, X.V., Sliwinski, J., Zick, Y.: The price of quota-based diversity in assignment problems. ACM Trans. Econ. Comput. (TEAC) 8(3), 1\u201332 (2020)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Bereg, S., et al.: The two-squirrel problem and its relatives. In: Japanese Conference on Discrete and Computational Geometry, Graphs, and Games. pp. 104\u2013120. Springer (2022)","DOI":"10.1007\/978-3-032-00281-5_8"},{"key":"27_CR8","unstructured":"de\u00a0Berg, M., L\u00f3pez\u00a0Mart\u00ednez, A., Spieksma, F.: Finding diverse minimum ST cuts. In: 34th International Symposium on Algorithms and Computation (ISAAC 2023), pp. 24\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Boehmer, N., Niedermeier, R.: Broadening the research agenda for computational social choice: Multiple preference profiles and multiple solutions. In: Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, pp.\u00a01\u20135 (2021)","DOI":"10.65109\/ZKSF4462"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Faliszewski, P., Igarashi, A., Lackner, M., Skowron, P.: Multiwinner elections with diversity constraints. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol.\u00a032 (2018)","DOI":"10.1609\/aaai.v32i1.11457"},{"issue":"4","key":"27_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.orl.2009.03.004","volume":"37","author":"E Danna","year":"2009","unstructured":"Danna, E., Woodruff, D.L.: How to select a small set of diverse solutions to mixed integer programming problems. Oper. Res. Lett. 37(4), 255\u2013260 (2009)","journal-title":"Oper. Res. Lett."},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Do, A.V., Guo, M., Neumann, A., Neumann, F.: Niching-based evolutionary diversity optimization for the traveling salesperson problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 684\u2013693 (2022)","DOI":"10.1145\/3512290.3528724"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: k-best enumeration. Encycl. Algorithms, 1003\u20131006 (2016)","DOI":"10.1007\/978-1-4939-2864-4_733"},{"issue":"6","key":"27_CR14","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1007\/s00453-024-01214-7","volume":"86","author":"FV Fomin","year":"2024","unstructured":"Fomin, F.V., Golovach, P.A., Jaffke, L., Philip, G., Sagunov, D.: Diverse pairs of matchings. Algorithmica 86(6), 2026\u20132040 (2024)","journal-title":"Algorithmica"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Gabor, T., Belzner, L., Phan, T., Schmid, K.: Preparing for the unexpected: diversity improves planning resilience in evolutionary algorithms. In: 2018 IEEE International Conference on Autonomic Computing (ICAC), pp. 131\u2013140. IEEE (2018)","DOI":"10.1109\/ICAC.2018.00023"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Glover, F., L\u00f8kketangen, A., Woodruff, D.L.: Scatter search to generate diverse mip solutions. In: Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, pp. 299\u2013317. Springer (2000)","DOI":"10.1007\/978-1-4615-4567-5_17"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Gupta, S., Moondra, J., Singh, M.: Balancing notions of equity: trade-offs between fair portfolio sizes and achievable guarantees. In: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1136\u20131165. SIAM (2025)","DOI":"10.1137\/1.9781611978322.33"},{"issue":"1","key":"27_CR18","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02022039","volume":"4","author":"HW Hamacher","year":"1985","unstructured":"Hamacher, H.W., Queyranne, M.: K best solutions to combinatorial optimization problems. Ann. Oper. Res. 4(1), 123\u2013143 (1985)","journal-title":"Ann. Oper. Res."},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Hanaka, T., Kobayashi, Y., Kurita, K., Otachi, Y.: Finding diverse trees, paths, and more. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol.\u00a035, pp. 3778\u20133786 (2021)","DOI":"10.1609\/aaai.v35i5.16495"},{"key":"27_CR20","unstructured":"Hebrard, E., Hnich, B., O\u2019Sullivan, B., Walsh, T.: Finding diverse and similar solutions in constraint programming. In: AAAI. vol.\u00a05, pp. 372\u2013377 (2005)"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Krarup, J.: The peripatetic salesman and some related unsolved problems. In: Combinatorial Programming: Methods and Applications: Proceedings of the NATO Advanced Study Institute held at the Palais des Congr\u00e8s, Versailles, France, 2\u201313 September, 1974, pp. 173\u2013178. Springer (1995)","DOI":"10.1007\/978-94-011-7557-9_8"},{"key":"27_CR22","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ipl.2018.12.004","volume":"144","author":"H L\u00fc","year":"2019","unstructured":"L\u00fc, H., Wu, T.: Edge-disjoint hamiltonian cycles of balanced hypercubes. Inf. Process. Lett. 144, 25\u201330 (2019)","journal-title":"Inf. Process. Lett."},{"key":"27_CR23","unstructured":"Misra, N., Mittal, H., Rai, A.: On the parameterized complexity of diverse sat. In: 35th International Symposium on Algorithms and Computation (ISAAC 2024), pp. 50\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"Paris, Q.: Dealing with Multiple Optimal Solutions, pp. 295\u2013307. Palgrave Macmillan US, New York (2016)","DOI":"10.1057\/9781137573926_15"},{"key":"27_CR25","unstructured":"Petit, T., Trapp, A.C.: Finding diverse solutions of high quality to constraint optimization problems. In: IJCAI. International Joint Conference on Artificial Intelligence (2015)"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Rowley, R., Bose, B.: Edge-disjoint hamiltonian cycles in de bruijn networks. In: Proceeding 6th Distributed Memory Computing Conference, pp. 707\u2013709 (1991)","DOI":"10.1109\/DMCC.1991.633359"},{"key":"27_CR27","unstructured":"Shida, Y., Punzi, G., Kobayashi, Y., Uno, T., Arimura, H.: Finding diverse strings and longest common subsequences in a graph. In: 35th Annual Symposium on Combinatorial Pattern Matching (CPM 2024), pp. 27\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"27_CR28","doi-asserted-by":"crossref","unstructured":"Thejaswi, S., Ordozgoiti, B., Gionis, A.: Diversity-aware k-median: clustering with fair center representation. In: Machine Learning and Knowledge Discovery in Databases. Research Track: European Conference, ECML PKDD 2021, Bilbao, Spain, September 13\u201317, 2021, Proceedings, Part II 21, pp. 765\u2013780. Springer (2021)","DOI":"10.1007\/978-3-030-86520-7_47"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:13:26Z","timestamp":1774325606000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}