{"id":"https://openalex.org/W4403556965","doi":"https://doi.org/10.1007/978-3-031-74498-3_17","title":"Partially Disjoint Shortest Paths and\u00a0Near-Shortest Paths Trees","display_name":"Partially Disjoint Shortest Paths and\u00a0Near-Shortest Paths Trees","publication_year":2024,"publication_date":"2024-10-19","ids":{"openalex":"https://openalex.org/W4403556965","doi":"https://doi.org/10.1007/978-3-031-74498-3_17"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-74498-3_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-74498-3_17","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/A5006177800","display_name":"Yefim Dinitz","orcid":"https://orcid.org/0009-0005-4211-4182"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Yefim Dinitz","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beer Sheva, Israel"],"raw_orcid":"https://orcid.org/0009-0005-4211-4182","affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beer Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060182415","display_name":"Shlomi Dolev","orcid":"https://orcid.org/0000-0001-5418-6670"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shlomi Dolev","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beer Sheva, Israel"],"raw_orcid":"https://orcid.org/0000-0001-5418-6670","affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beer Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038845271","display_name":"Manish Kumar","orcid":"https://orcid.org/0000-0003-0620-3303"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Manish Kumar","raw_affiliation_strings":["New Jersey Institute of Technology, Newark, NJ, USA"],"raw_orcid":"https://orcid.org/0000-0003-0620-3303","affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology, Newark, NJ, USA","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089964489","display_name":"Baruch Schieber","orcid":null},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Baruch Schieber","raw_affiliation_strings":["New Jersey Institute of Technology, Newark, NJ, USA"],"raw_orcid":"https://orcid.org/0009-0006-5750-2177","affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology, Newark, NJ, USA","institution_ids":["https://openalex.org/I118118575"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5006177800"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"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.51247118,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"240","last_page":"254"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976999759674072,"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/disjoint-sets","display_name":"Disjoint sets","score":0.7798491716384888},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7627168893814087},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5248128175735474},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4695335626602173},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.3978474736213684},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3584357500076294},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3559366762638092},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3151235580444336},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1573823094367981},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0838780403137207}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7798491716384888},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7627168893814087},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5248128175735474},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4695335626602173},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3978474736213684},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3584357500076294},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3559366762638092},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3151235580444336},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1573823094367981},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0838780403137207}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-74498-3_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-74498-3_17","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1930659875","https://openalex.org/W1964122629","https://openalex.org/W1997417333","https://openalex.org/W2005079828","https://openalex.org/W2006121663","https://openalex.org/W2011282943","https://openalex.org/W2086807633","https://openalex.org/W2138249013","https://openalex.org/W2151715608","https://openalex.org/W2152754876","https://openalex.org/W2157411165","https://openalex.org/W2166462345","https://openalex.org/W2296055404","https://openalex.org/W2808374365","https://openalex.org/W2810179156","https://openalex.org/W3036445721","https://openalex.org/W3147903655","https://openalex.org/W3179701043","https://openalex.org/W4283796612"],"related_works":["https://openalex.org/W2354846196","https://openalex.org/W2391130892","https://openalex.org/W4293054712","https://openalex.org/W2360981904","https://openalex.org/W2348761196","https://openalex.org/W2347245430","https://openalex.org/W1617152041","https://openalex.org/W2392078542","https://openalex.org/W1519427079","https://openalex.org/W2597144308"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-12-27T23:08:20.325037","created_date":"2025-10-10T00:00:00"}