{"id":"https://openalex.org/W1538812184","doi":"https://doi.org/10.1007/978-3-540-27796-5_24","title":"NP-Completeness Results for All-Shortest-Path Interval Routing","display_name":"NP-Completeness Results for All-Shortest-Path Interval Routing","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1538812184","doi":"https://doi.org/10.1007/978-3-540-27796-5_24","mag":"1538812184"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-27796-5_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27796-5_24","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/A5050430253","display_name":"Rui Wang","orcid":"https://orcid.org/0000-0002-5063-5691"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Rui Wang","raw_affiliation_strings":["Department of Computer Science and Information Systems, The University of Hong Kong,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Systems, The University of Hong Kong,","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079339840","display_name":"Francis C. M. Lau","orcid":"https://orcid.org/0000-0002-8279-0899"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Francis C. M. Lau","raw_affiliation_strings":["Department of Computer Science and Information Systems, The University of Hong Kong,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Systems, The University of Hong Kong,","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100416810","display_name":"Yanyan Liu","orcid":"https://orcid.org/0000-0002-1405-7345"},"institutions":[{"id":"https://openalex.org/I59028903","display_name":"Ocean University of China","ror":"https://ror.org/04rdtx186","country_code":"CN","type":"education","lineage":["https://openalex.org/I59028903"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yan Yan Liu","raw_affiliation_strings":["Department of Computer Science, The Ocean University of China,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The Ocean University of China,","institution_ids":["https://openalex.org/I59028903"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050430253"],"corresponding_institution_ids":["https://openalex.org/I889458895"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.275,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.57968476,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"267","last_page":"278"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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.9987000226974487,"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.8087326288223267},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6157248020172119},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5360012650489807},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5230225920677185},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5217465162277222},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4650856852531433},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.45828479528427124},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4130750298500061},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.4126942753791809},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.41111063957214355},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36041319370269775}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8087326288223267},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6157248020172119},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5360012650489807},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5230225920677185},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5217465162277222},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4650856852531433},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.45828479528427124},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4130750298500061},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.4126942753791809},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.41111063957214355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36041319370269775}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-27796-5_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27796-5_24","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:hub.hku.hk:10722/152369","is_oa":false,"landing_page_url":"http://hdl.handle.net/10722/152369","pdf_url":null,"source":{"id":"https://openalex.org/S4377196271","display_name":"The HKU Scholars Hub (University of Hong Kong)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I889458895","host_organization_name":"University of Hong Kong","host_organization_lineage":["https://openalex.org/I889458895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W137210891","https://openalex.org/W1511174345","https://openalex.org/W2011039300","https://openalex.org/W2030306674","https://openalex.org/W2049164482","https://openalex.org/W2049670817","https://openalex.org/W2076497945","https://openalex.org/W2113613597","https://openalex.org/W2117860759","https://openalex.org/W2151358465","https://openalex.org/W2158760119"],"related_works":["https://openalex.org/W2018146256","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2040572217","https://openalex.org/W2348504720","https://openalex.org/W2612665926","https://openalex.org/W2323352958","https://openalex.org/W4294360851","https://openalex.org/W2183811469","https://openalex.org/W4293054712"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}