{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:54:18Z","timestamp":1729612458219,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1109\/fgct.2013.6767208","type":"proceedings-article","created":{"date-parts":[[2014,3,20]],"date-time":"2014-03-20T19:25:36Z","timestamp":1395343536000},"page":"169-177","source":"Crossref","is-referenced-by-count":0,"title":["Everything is better with sprinkles: Greedy routing with bounded stretch"],"prefix":"10.1109","author":[{"given":"Christoph","family":"Werle","sequence":"first","affiliation":[]},{"given":"Oliver P.","family":"Waldhorst","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.4108\/ICST.SIMUTOOLS2008.3027"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ICON.2011.6168493"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2011.5928931"},{"key":"14","first-page":"1","article-title":"Compact routing schemes","author":"thorup","year":"2001","journal-title":"Proc 13th ACM Symp on Parallel Algorithms and Architectures (SPAA 2001"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/1096536.1096546"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1921168.1921195"},{"journal-title":"Cooperative Association for Internet Data Analysis","year":"2003","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972863.12"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1080\/10586458.2001.10504428"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/319056.319004"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2011.6089081"},{"key":"6","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1006\/jpdc.2000.1705","article-title":"Space-efficiency for routing schemes of stretch factor three","volume":"61","author":"gavoille","year":"2001","journal-title":"J Parallel Distrib Comput"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224989"},{"key":"4","first-page":"379","article-title":"Compact routing in power-law graphs","author":"chen","year":"2009","journal-title":"Proc 23rd Int Conf on Distributed Computing (DISC 2009"},{"key":"9","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/3-540-46784-X_5","article-title":"Proximity-preserving labeling schemes and their applications","author":"peleg","year":"1999","journal-title":"Proc 25th Int Workshop on Graph-Theoretic Concepts in Computer Science"},{"key":"8","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1109\/TNET.2010.2046645","article-title":"S4: Small state and small stretch compact routing protocol for large static wireless networks","volume":"18","author":"mao","year":"2010","journal-title":"IEEE\/ ACM Trans on Networking"}],"event":{"name":"2013 Second International Conference on Future Generation Communication Technology (FGCT)","start":{"date-parts":[[2013,11,12]]},"location":"London, United Kingdom","end":{"date-parts":[[2013,11,14]]}},"container-title":["Second International Conference on Future Generation Communication Technologies (FGCT 2013)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6766332\/6767177\/06767208.pdf?arnumber=6767208","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T18:47:29Z","timestamp":1565290049000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6767208\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/fgct.2013.6767208","relation":{},"subject":[],"published":{"date-parts":[[2013,11]]}}}