@inproceedings{73495eb5c41e40849e195ce35c5a582e,

title = "Compact routing schemes with improved stretch",

abstract = "We consider the problem of compact routing in weighted general undirected graphs, in which the goal is to construct local routing tables that allow information to be sent on short paths in the network. In this paper the first improvement to the work of Thorup and Zwick [SPAA'01] is presented. Specifically, we construct an improved routing scheme obtaining for every k routing tables of size O (n1/klog D), and stretch (4 - α) k - β for some absolute constants α, β > 0, where D is the normalized diameter. This provides a positive answer to a main open question in this area as to the existence of a routing scheme with stretch c • k for some constant c < 4.",

keywords = "Compact routing, Name independent routing, Stretch factor",

author = "Shiri Chechik",

year = "2013",

doi = "https://doi.org/10.1145/2484239.2484268",

language = "الإنجليزيّة",

isbn = "9781450320658",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

pages = "33--41",

booktitle = "PODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing",

note = "2013 ACM Symposium on Principles of Distributed Computing, PODC 2013 ; Conference date: 22-07-2013 Through 24-07-2013",

}