{"id":"https://openalex.org/W3147002910","doi":"https://doi.org/10.1007/978-3-030-78086-9_20","title":"Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths","display_name":"Polynomial Time k-Shortest Multi-criteria Prioritized and All-Criteria-Disjoint Paths","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3147002910","doi":"https://doi.org/10.1007/978-3-030-78086-9_20","mag":"3147002910"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-78086-9_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-78086-9_20","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":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2101.11514","any_repository_has_fulltext":true},"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, Be'er Sheva, Israel"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Be'er 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, Be'er Sheva, Israel"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Be'er Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038845271","display_name":"Manish Kumar","orcid":"https://orcid.org/0000-0003-0620-3303"},"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":"Manish Kumar","raw_affiliation_strings":["Ben\u2010Gurion University of the Negev"],"affiliations":[{"raw_affiliation_string":"Ben\u2010Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"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":1.0905,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.78572932,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"266","last_page":"274"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.994700014591217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7463262677192688},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.7403362989425659},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.6572409272193909},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6325854063034058},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6295275092124939},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5783081650733948},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5565454959869385},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4705246686935425},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4611421525478363},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4402958154678345},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4134369194507599},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.41302022337913513},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3909178674221039},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3052406907081604},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.09512907266616821}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7463262677192688},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.7403362989425659},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.6572409272193909},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6325854063034058},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6295275092124939},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5783081650733948},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5565454959869385},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4705246686935425},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4611421525478363},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4402958154678345},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4134369194507599},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.41302022337913513},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3909178674221039},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3052406907081604},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.09512907266616821}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-030-78086-9_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-78086-9_20","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:arXiv.org:2101.11514","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2101.11514","pdf_url":"https://arxiv.org/pdf/2101.11514","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:3147002910","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/2101.11514","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2101.11514","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2101.11514","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2101.11514","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2101.11514","pdf_url":"https://arxiv.org/pdf/2101.11514","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W119169328","https://openalex.org/W1507039213","https://openalex.org/W1543017602","https://openalex.org/W1773616669","https://openalex.org/W1970543907","https://openalex.org/W1977545325","https://openalex.org/W2004920754","https://openalex.org/W2011039300","https://openalex.org/W2011282943","https://openalex.org/W2066047491","https://openalex.org/W2094099891","https://openalex.org/W2102760493","https://openalex.org/W2111340560","https://openalex.org/W2118681568","https://openalex.org/W2119257015","https://openalex.org/W2125401948","https://openalex.org/W2130626677","https://openalex.org/W2148837283","https://openalex.org/W2151715608","https://openalex.org/W2160658249","https://openalex.org/W2169528473","https://openalex.org/W2252026542","https://openalex.org/W2340365916","https://openalex.org/W2967057359","https://openalex.org/W3036445721","https://openalex.org/W3121758909"],"related_works":["https://openalex.org/W2025595264","https://openalex.org/W2808374365","https://openalex.org/W2048751169","https://openalex.org/W2907843763","https://openalex.org/W177082126","https://openalex.org/W1515735476","https://openalex.org/W2063916905","https://openalex.org/W2291489045","https://openalex.org/W2114496166","https://openalex.org/W2371766423","https://openalex.org/W2056857778","https://openalex.org/W2033242257","https://openalex.org/W1501936286","https://openalex.org/W3001053786","https://openalex.org/W2907061525","https://openalex.org/W3137352489","https://openalex.org/W1533055364","https://openalex.org/W2784293985","https://openalex.org/W2030790968","https://openalex.org/W1496451055"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}