{"id":"https://openalex.org/W1560875342","doi":"https://doi.org/10.1007/11561071_5","title":"Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio","display_name":"Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1560875342","doi":"https://doi.org/10.1007/11561071_5","mag":"1560875342"},"language":"en","primary_location":{"id":"doi:10.1007/11561071_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11561071_5","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":"conference-paper","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/A5068644412","display_name":"Stefan R\u00fchrup","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]},{"id":"https://openalex.org/I4210152224","display_name":"Heinz Nixdorf Stiftung","ror":"https://ror.org/04j2tkk21","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I4210152224"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan R\u00fchrup","raw_affiliation_strings":["Heinz Nixdorf Institute, University of Paderborn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Heinz Nixdorf Institute, University of Paderborn, Germany","institution_ids":["https://openalex.org/I4210152224","https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068757827","display_name":"Christian Schindelhauer","orcid":"https://orcid.org/0000-0002-8320-8581"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]},{"id":"https://openalex.org/I4210152224","display_name":"Heinz Nixdorf Stiftung","ror":"https://ror.org/04j2tkk21","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I4210152224"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Schindelhauer","raw_affiliation_strings":["Heinz Nixdorf Institute, University of Paderborn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Heinz Nixdorf Institute, University of Paderborn, Germany","institution_ids":["https://openalex.org/I4210152224","https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"23","last_page":"34"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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/T10246","display_name":"Mobile Ad Hoc Networks","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/T10772","display_name":"Distributed systems and fault tolerance","score":0.998199999332428,"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/traverse","display_name":"Traverse","score":0.7124943733215332},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5726866126060486},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.567892849445343},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5653687715530396},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5489698648452759},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4912528395652771},{"id":"https://openalex.org/keywords/quotient","display_name":"Quotient","score":0.47791653871536255},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46734386682510376},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4636456072330475},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.44130757451057434},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4352089464664459},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3818899691104889},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3577769994735718},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3567394018173218},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2909129858016968},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2617923617362976},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.25772038102149963}],"concepts":[{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.7124943733215332},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5726866126060486},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.567892849445343},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5653687715530396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5489698648452759},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4912528395652771},{"id":"https://openalex.org/C199422724","wikidata":"https://www.wikidata.org/wiki/Q41118","display_name":"Quotient","level":2,"score":0.47791653871536255},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46734386682510376},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4636456072330475},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.44130757451057434},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4352089464664459},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3818899691104889},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3577769994735718},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3567394018173218},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2909129858016968},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2617923617362976},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.25772038102149963},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/11561071_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11561071_5","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:CiteSeerX.psu:10.1.1.414.6695","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.414.6695","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://archive.cone.informatik.uni-freiburg.de/pubs/ESA05A_Ruehrup.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.60.6476","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.6476","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://wwwcs.uni-paderborn.de/cs/ag-madh/WWW/sr/esa05.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.60.7122","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.7122","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://wwwcs.uni-paderborn.de/cs/ag-madh/WWW/sr/tr-rsfb-05-076.pdf","raw_type":"text"}],"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/W1538209031","https://openalex.org/W1550444125","https://openalex.org/W1552828154","https://openalex.org/W1555244589","https://openalex.org/W1560875342","https://openalex.org/W1561560534","https://openalex.org/W2047724932","https://openalex.org/W2088357751","https://openalex.org/W2095383780","https://openalex.org/W2114302864","https://openalex.org/W2119559506","https://openalex.org/W2124546002","https://openalex.org/W2127154585","https://openalex.org/W2135572590","https://openalex.org/W2145278435","https://openalex.org/W2156689181","https://openalex.org/W2159472851","https://openalex.org/W2164470020","https://openalex.org/W2171878649","https://openalex.org/W2175742361","https://openalex.org/W2497341967","https://openalex.org/W4240538936"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2567853751","https://openalex.org/W4240895316"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}