{"id":"https://openalex.org/W7128800200","doi":"https://doi.org/10.1007/978-981-95-7127-7_27","title":"Disjoint Tours and\u00a0the\u00a0Price of\u00a0Diversity","display_name":"Disjoint Tours and\u00a0the\u00a0Price of\u00a0Diversity","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7128800200","doi":"https://doi.org/10.1007/978-981-95-7127-7_27"},"language":"en","primary_location":{"id":"doi:10.1007/978-981-95-7127-7_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-95-7127-7_27","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113668100","display_name":"Mark de Berg","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mark de Berg","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035015814","display_name":"Andr\u00e9s L\u00f3pez Mart\u00ednez","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Andr\u00e9s L\u00f3pez Mart\u00ednez","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052356379","display_name":"Frits Spieksma","orcid":"https://orcid.org/0000-0002-2547-3782"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Frits Spieksma","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5035015814"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.66997871,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"402","last_page":"417"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.7702999711036682,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.7702999711036682,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.08969999849796295,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.03310000151395798,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8288000226020813},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7562999725341797},{"id":"https://openalex.org/keywords/diversity","display_name":"Diversity (politics)","score":0.6438000202178955},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6064000129699707},{"id":"https://openalex.org/keywords/performance-metric","display_name":"Performance metric","score":0.30469998717308044},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.29260000586509705}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8288000226020813},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7562999725341797},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.753600001335144},{"id":"https://openalex.org/C2781316041","wikidata":"https://www.wikidata.org/wiki/Q1230584","display_name":"Diversity (politics)","level":2,"score":0.6438000202178955},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6064000129699707},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3635999858379364},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35580000281333923},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31360000371932983},{"id":"https://openalex.org/C2780898871","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Performance metric","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.29260000586509705},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.28769999742507935},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.27309998869895935},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.2700999975204468},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.250900000333786}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-981-95-7127-7_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-95-7127-7_27","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.tue.nl:publications/592ff4bc-c7e0-4792-90e1-1ad94cc63ce2","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/592ff4bc-c7e0-4792-90e1-1ad94cc63ce2","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"de Berg, M, L\u00f3pez Mart\u00ednez, A & Spieksma, F 2026, Disjoint Tours and\u00a0the\u00a0Price of\u00a0Diversity. in E Di Giacomo & D Mondal (eds), WALCOM: Algorithms and Computation : 20th International Conference and Workshops on Algorithms and Computation, WALCOM 2026, Perugia, Italy, March 4\u20136, 2026, Proceedings. Lecture Notes in Computer Science (LNCS), vol. 16444, Springer, Singapore, pp. 402-417, 20th International Conference and Workshops on Algorithms and Computation, WALCOM 2026, Perugia, Italy, 4/03/26. https://doi.org/10.1007/978-981-95-7127-7_27","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.40967729687690735,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W27109896","https://openalex.org/W1574377372","https://openalex.org/W1603350720","https://openalex.org/W1605923078","https://openalex.org/W1976720680","https://openalex.org/W2007872274","https://openalex.org/W2502495409","https://openalex.org/W2592375611","https://openalex.org/W2768254850","https://openalex.org/W2895824045","https://openalex.org/W2904589382","https://openalex.org/W2984849941","https://openalex.org/W3084126163","https://openalex.org/W3084163365","https://openalex.org/W3089442582","https://openalex.org/W3174365121","https://openalex.org/W3203345503","https://openalex.org/W4221156050","https://openalex.org/W4239574223","https://openalex.org/W4386027258","https://openalex.org/W4406141825","https://openalex.org/W4413232290"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-03-29T08:15:47.926485","created_date":"2026-02-14T00:00:00"}