{"id":"https://openalex.org/W2010216648","doi":"https://doi.org/10.1145/1383369.1383372","title":"Dynamic routing schemes for graphs with low local density","display_name":"Dynamic routing schemes for graphs with low local density","publication_year":2008,"publication_date":"2008-08-01","ids":{"openalex":"https://openalex.org/W2010216648","doi":"https://doi.org/10.1145/1383369.1383372","mag":"2010216648"},"language":"en","primary_location":{"id":"doi:10.1145/1383369.1383372","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1383369.1383372","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5040995971","display_name":"Amos Korman","orcid":"https://orcid.org/0000-0001-8652-9228"},"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":"Amos Korman","raw_affiliation_strings":["Technion, Haifa, Israel","Technion , Haifa , Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion , Haifa , Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056419022","display_name":"David Peleg","orcid":"https://orcid.org/0000-0003-1590-0506"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"David Peleg","raw_affiliation_strings":["Weizmann Institute, Rehovot, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Weizmann Institute, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040995971"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":2.0693,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.86526209,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"4","issue":"4","first_page":"1","last_page":"18"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9980000257492065,"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/bounding-overwatch","display_name":"Bounding overwatch","score":0.6731963157653809},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5392144918441772},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5213728547096252},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46020975708961487},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.42668992280960083},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3262858986854553},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09391644597053528}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6731963157653809},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5392144918441772},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5213728547096252},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46020975708961487},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.42668992280960083},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3262858986854553},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09391644597053528},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1383369.1383372","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1383369.1383372","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.104.2507","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.2507","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://iew3.technion.ac.il/~pandit/time-general-routing-full.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":28,"referenced_works":["https://openalex.org/W1568961751","https://openalex.org/W1612498707","https://openalex.org/W1689114857","https://openalex.org/W2005580106","https://openalex.org/W2006383304","https://openalex.org/W2007232927","https://openalex.org/W2014530464","https://openalex.org/W2025387541","https://openalex.org/W2025902957","https://openalex.org/W2042148510","https://openalex.org/W2044087623","https://openalex.org/W2054910423","https://openalex.org/W2057994027","https://openalex.org/W2073641778","https://openalex.org/W2077824753","https://openalex.org/W2080608361","https://openalex.org/W2091569826","https://openalex.org/W2095325302","https://openalex.org/W2097550055","https://openalex.org/W2151358465","https://openalex.org/W2156060048","https://openalex.org/W2165755919","https://openalex.org/W2169244182","https://openalex.org/W2180413174","https://openalex.org/W2570021665","https://openalex.org/W3098011928","https://openalex.org/W4205300528","https://openalex.org/W4244805165"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793","https://openalex.org/W4238204885","https://openalex.org/W2963966623"],"abstract_inverted_index":{"This":[0],"article":[1,111,167],"studies":[2],"approximate":[3,113],"distributed":[4],"routing":[5,52,65,74,115],"schemes":[6,116],"on":[7,14,156,174],"dynamic":[8,15,45,73,114],"communication":[9],"networks.":[10],"The":[11,47,166],"work":[12],"focuses":[13],"weighted":[16],"general":[17],"graphs":[18,157],"where":[19,99,127],"the":[20,23,28,31,40,57,64,93,102,105,130,135,175,178,182],"vertices":[21,79],"of":[22,30,42,50,104,134,177],"graph":[24],"are":[25],"fixed,":[26],"but":[27],"weights":[29],"edges":[32],"may":[33],"change.":[34,70],"Our":[35],"main":[36],"contribution":[37],"concerns":[38],"bounding":[39],"cost":[41],"adapting":[43],"to":[44,62,91],"changes.":[46],"update":[48,63],"efficiency":[49],"a":[51,68,81,139],"scheme":[53,66,143,152,183],"is":[54,101,129,153],"measured":[55],"by":[56,181],"time":[58,88,119],"needed":[59],"in":[60,89],"order":[61,90],"following":[67,80],"weight":[69,82,97,140],"A":[71],"naive":[72],"scheme,":[75],"which":[76,158],"updates":[77,94],"all":[78],"change,":[83,98,126,141],"requires":[84],"\u03a9(":[85],"Diam":[86,100,148],")":[87,123],"perform":[92],"after":[95],"every":[96],"diameter":[103],"underlying":[106,136],"graph.":[107,137],"In":[108],"contrast,":[109],"this":[110],"presents":[112],"with":[117],"average":[118],"complexity":[120],"\u0398\u02dc(":[121],"D":[122,128],"per":[124],"topological":[125],"local":[131,161],"density":[132,162],"parameter":[133],"Following":[138],"our":[142,151],"never":[144],"incurs":[145],"more":[146],"than":[147],"time;":[149],"thus,":[150],"particularly":[154],"efficient":[155],"have":[159],"low":[160],"and":[163,171],"large":[164],"diameter.":[165],"also":[168],"establishes":[169],"upper":[170],"lower":[172],"bounds":[173],"size":[176],"databases":[179],"required":[180],"at":[184],"each":[185],"site.":[186]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}