{"id":"https://openalex.org/W2113613597","doi":"https://doi.org/10.1016/s0304-3975(01)00180-3","title":"The complexity of the characterization of networks supporting shortest-path interval routing","display_name":"The complexity of the characterization of networks supporting shortest-path interval routing","publication_year":2002,"publication_date":"2002-10-01","ids":{"openalex":"https://openalex.org/W2113613597","doi":"https://doi.org/10.1016/s0304-3975(01)00180-3","mag":"2113613597"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(01)00180-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00180-3","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","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/A5074767181","display_name":"Tamar Eilam","orcid":"https://orcid.org/0000-0002-0912-0776"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"T. Eilam","raw_affiliation_strings":["Department of Computer Science, The Technion-Israel Institute of Technology, Technion-City, Haifa 32000, Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The Technion-Israel Institute of Technology, Technion-City, Haifa 32000, Israel#TAB#","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007961513","display_name":"Shlomo Moran","orcid":"https://orcid.org/0000-0003-3222-3308"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"S. Moran","raw_affiliation_strings":["Department of Computer Science, The Technion-Israel Institute of Technology, Technion-City, Haifa 32000, Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The Technion-Israel Institute of Technology, Technion-City, Haifa 32000, Israel#TAB#","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009919512","display_name":"Shmuel Zaks","orcid":"https://orcid.org/0000-0001-5637-4923"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"S. Zaks","raw_affiliation_strings":["Department of Computer Science, The Technion-Israel Institute of Technology, Technion-City, Haifa 32000, Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The Technion-Israel Institute of Technology, Technion-City, Haifa 32000, Israel#TAB#","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074767181"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":2.4421,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.8972437,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"289","issue":"1","first_page":"85","last_page":"104"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9991999864578247,"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.9983000159263611,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7119576930999756},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.602668046951294},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5659173130989075},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.554506242275238},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5514088273048401},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5229231119155884},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5213305354118347},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5137604475021362},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4153246581554413},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41476041078567505},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4101126790046692},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37433651089668274},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.37108367681503296},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.327578604221344},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.21403422951698303},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17742416262626648},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08978953957557678}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7119576930999756},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.602668046951294},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5659173130989075},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.554506242275238},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5514088273048401},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5229231119155884},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5213305354118347},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5137604475021362},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4153246581554413},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41476041078567505},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4101126790046692},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37433651089668274},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.37108367681503296},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.327578604221344},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.21403422951698303},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17742416262626648},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08978953957557678},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C171250308","wikidata":"https://www.wikidata.org/wiki/Q11468","display_name":"Nanotechnology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0304-3975(01)00180-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00180-3","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1508053042","https://openalex.org/W1521744432","https://openalex.org/W1525397299","https://openalex.org/W1534598974","https://openalex.org/W1572670762","https://openalex.org/W1837271383","https://openalex.org/W2020085766","https://openalex.org/W2030306674","https://openalex.org/W2033112846","https://openalex.org/W2038033022","https://openalex.org/W2063048655","https://openalex.org/W2075805185","https://openalex.org/W2076497945","https://openalex.org/W2091569826","https://openalex.org/W2102159495","https://openalex.org/W2130026731","https://openalex.org/W2151358465","https://openalex.org/W2151717792","https://openalex.org/W2293001982","https://openalex.org/W2476613922","https://openalex.org/W2496833595","https://openalex.org/W2914484629"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W2375775343","https://openalex.org/W1990043277","https://openalex.org/W2962525871","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2388051136","https://openalex.org/W3094029073"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}