{"id":"https://openalex.org/W2008007365","doi":"https://doi.org/10.1145/1281100.1281114","title":"Compact routing with slack","display_name":"Compact routing with slack","publication_year":2007,"publication_date":"2007-08-12","ids":{"openalex":"https://openalex.org/W2008007365","doi":"https://doi.org/10.1145/1281100.1281114","mag":"2008007365"},"language":"en","primary_location":{"id":"doi:10.1145/1281100.1281114","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1281100.1281114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing","raw_type":"proceedings-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/A5049161363","display_name":"Michael Dinitz","orcid":"https://orcid.org/0000-0002-2632-966X"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Dinitz","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA","Carnegie-Mellon University, Pittsburgh, PA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5049161363"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.4943,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.81821828,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"81","last_page":"88"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/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/T12288","display_name":"Optimization and Search Problems","score":0.996999979019165,"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/multiplicative-function","display_name":"Multiplicative function","score":0.7134932279586792},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6287529468536377},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6219863295555115},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5765838623046875},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5399354696273804},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.4999880790710449},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4860287308692932},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4721408188343048},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.44391539692878723},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.42954879999160767},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42107540369033813},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3496288061141968},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34417498111724854},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3255373239517212},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15034222602844238},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06999632716178894}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.7134932279586792},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6287529468536377},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6219863295555115},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5765838623046875},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5399354696273804},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.4999880790710449},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4860287308692932},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4721408188343048},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.44391539692878723},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.42954879999160767},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42107540369033813},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3496288061141968},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34417498111724854},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3255373239517212},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15034222602844238},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06999632716178894},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1281100.1281114","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1281100.1281114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.117.5925","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.5925","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~mdinitz/slack_routing_podc07.ps.gz","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":15,"referenced_works":["https://openalex.org/W1491309030","https://openalex.org/W1504741231","https://openalex.org/W1587867115","https://openalex.org/W1602024640","https://openalex.org/W1905029509","https://openalex.org/W2004000882","https://openalex.org/W2017271493","https://openalex.org/W2031536548","https://openalex.org/W2045446569","https://openalex.org/W2057994027","https://openalex.org/W2060898859","https://openalex.org/W2132452995","https://openalex.org/W2169140571","https://openalex.org/W2169192748","https://openalex.org/W4242664832"],"related_works":["https://openalex.org/W2487162673","https://openalex.org/W2793211469","https://openalex.org/W2949152769","https://openalex.org/W4372354731","https://openalex.org/W2942366970","https://openalex.org/W2807634898","https://openalex.org/W1692008701","https://openalex.org/W2597588799","https://openalex.org/W4360593462","https://openalex.org/W2562400057"],"abstract_inverted_index":{"Given":[0],"a":[1,5,10,64,83,111,134],"weighted":[2],"graph":[3],"G=(V,E),":[4],"compact":[6],"routing":[7],"scheme":[8,137],"is":[9,25],"distributed":[11],"algorithm":[12],"for":[13,141],"forwarding":[14],"packets":[15],"from":[16],"any":[17,20],"source":[18],"to":[19,71,74],"destination.":[21],"The":[22],"fundamental":[23],"tradeoff":[24],"between":[26,45],"the":[27,34,37,42,46,51,54,60,77,86,100,105,123,128],"space":[28,97],"used":[29],"at":[30],"each":[31],"node":[32],"and":[33,50,81,103,109,146],"stretch":[35,150],"of":[36,53,76],"total":[38],"route,":[39],"measured":[40],"by":[41],"multiplicative":[43],"factor":[44],"actual":[47],"distance":[48],"traveled":[49],"length":[52],"shortest":[55,78],"possible":[56],"route.":[57],"We":[58],"extend":[59],"normal":[61],"definition":[62],"with":[63,151],"slack":[65],"parameter":[66],"\u03b5,":[67],"which":[68,138],"allows":[69],"us":[70],"ignore":[72],"up":[73],"\u03b5n2":[75],"pairwise":[79],"routes":[80],"give":[82,93,110,133],"guarantee":[84],"on":[85],"remaining":[87],"ones.":[88],"For":[89],"constant":[90,94,148],"\u03b5":[91,143],"we":[92,131],"stretch,":[95],"polylogarithmic":[96],"schemes":[98,118],"in":[99,104,122],"name-dependent":[101,129],"model":[102,130],"designer-port":[106],"name-independent":[107,125],"model,":[108],"lower":[112],"bound":[113],"that":[114,116],"proves":[115],"such":[117],"do":[119],"not":[120],"exist":[121],"fixed-port":[124],"model.":[126],"In":[127],"also":[132],"gracefully":[135],"degrading":[136],"works":[139],"simultaneously":[140],"all":[142],">":[144],"0":[145],"guarantees":[147],"average":[149],"polylog":[152],"space.":[153]},"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}