{"id":"https://openalex.org/W2091225758","doi":"https://doi.org/10.1016/s0304-3975(99)00284-4","title":"On the complexity of multi-dimensional interval routing schemes","display_name":"On the complexity of multi-dimensional interval routing schemes","publication_year":2000,"publication_date":"2000-08-01","ids":{"openalex":"https://openalex.org/W2091225758","doi":"https://doi.org/10.1016/s0304-3975(99)00284-4","mag":"2091225758"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(99)00284-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(99)00284-4","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/A5075069780","display_name":"Peter R\u016f\u017ei\u010dka","orcid":null},"institutions":[{"id":"https://openalex.org/I4210152232","display_name":"Institute of Informatics of the Slovak Academy of Sciences","ror":"https://ror.org/04jgqpc26","country_code":"SK","type":"facility","lineage":["https://openalex.org/I207624831","https://openalex.org/I4210152232"]},{"id":"https://openalex.org/I74788687","display_name":"Comenius University Bratislava","ror":"https://ror.org/0587ef340","country_code":"SK","type":"education","lineage":["https://openalex.org/I74788687"]}],"countries":["SK"],"is_corresponding":true,"raw_author_name":"Peter Ru\u017ei\u010dka","raw_affiliation_strings":["Institute of Informatics, Faculty of Mathematics and Physics, Comenius University, Bratislava, Slovak Republic"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, Faculty of Mathematics and Physics, Comenius University, Bratislava, Slovak Republic","institution_ids":["https://openalex.org/I74788687","https://openalex.org/I4210152232"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088287514","display_name":"Daniel \u0160tefankovi\u010d","orcid":"https://orcid.org/0000-0002-4849-7955"},"institutions":[{"id":"https://openalex.org/I74788687","display_name":"Comenius University Bratislava","ror":"https://ror.org/0587ef340","country_code":"SK","type":"education","lineage":["https://openalex.org/I74788687"]}],"countries":["SK"],"is_corresponding":false,"raw_author_name":"Daniel \u0160tefankovi\u010d","raw_affiliation_strings":["Department of Computer Science, Faculty of Mathematics and Physics, Comenius University, Bratislava, Slovak Republic"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Mathematics and Physics, Comenius University, Bratislava, Slovak Republic","institution_ids":["https://openalex.org/I74788687"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075069780"],"corresponding_institution_ids":["https://openalex.org/I4210152232","https://openalex.org/I74788687"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":2.1708,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.89516588,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"245","issue":"2","first_page":"255","last_page":"280"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9987999796867371,"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.9955000281333923,"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/routing","display_name":"Routing (electronic design automation)","score":0.5835913419723511},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.5738838911056519},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5726728439331055},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5653203129768372},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.519388735294342},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5170689225196838},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49436426162719727},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48394420742988586},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34531134366989136},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3348865509033203},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3286973536014557},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.3281061053276062},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2709130644798279},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24487990140914917},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1201925277709961}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5835913419723511},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.5738838911056519},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5726728439331055},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5653203129768372},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.519388735294342},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5170689225196838},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49436426162719727},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48394420742988586},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34531134366989136},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3348865509033203},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3286973536014557},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.3281061053276062},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2709130644798279},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24487990140914917},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1201925277709961},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0304-3975(99)00284-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(99)00284-4","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W42780094","https://openalex.org/W70118921","https://openalex.org/W1521744432","https://openalex.org/W1575592201","https://openalex.org/W1578854291","https://openalex.org/W1638203394","https://openalex.org/W1674997539","https://openalex.org/W1695740880","https://openalex.org/W1864067855","https://openalex.org/W1968698408","https://openalex.org/W1975667020","https://openalex.org/W1982100216","https://openalex.org/W2018598057","https://openalex.org/W2020085766","https://openalex.org/W2049142782","https://openalex.org/W2060549152","https://openalex.org/W2130026731","https://openalex.org/W2146257986","https://openalex.org/W2151358465","https://openalex.org/W2158235975","https://openalex.org/W2295428206","https://openalex.org/W2337943869","https://openalex.org/W2914484629","https://openalex.org/W3003623942","https://openalex.org/W6631172325","https://openalex.org/W6634366574","https://openalex.org/W6637391672","https://openalex.org/W6738967707","https://openalex.org/W6829352048"],"related_works":["https://openalex.org/W3127002380","https://openalex.org/W2157538834","https://openalex.org/W2352845636","https://openalex.org/W2613682624","https://openalex.org/W2082566976","https://openalex.org/W2182591555","https://openalex.org/W165068231","https://openalex.org/W2589167684","https://openalex.org/W2369989480","https://openalex.org/W2361465121"],"abstract_inverted_index":null,"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}