乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:04:56Z","timestamp":1725617096229},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,4]]},"DOI":"10.1145\/1989493.1989526","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T10:36:21Z","timestamp":1307529381000},"page":"225-234","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Sparse spanners vs. compact routing"],"prefix":"10.1145","author":[{"given":"Cyril","family":"Gavoille","sequence":"first","affiliation":[{"name":"LaBRI - Universit\u00e9 de Bordeaux, 33405 Talence cedex, France"}]},{"given":"Christian","family":"Sommer","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146411"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2006.72"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_32"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367064.1367077"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248381"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02189308"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/04062053"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90017-9"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89571"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868237.1868242"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.12.091"},{"key":"e_1_3_2_1_12_1","volume-title":"Symposium on Discrete Algorithms (SODA)","author":"Bollob\u00e1s B.","year":"2003","unstructured":"B. Bollob\u00e1s , D. Coppersmith , and M. L. Elkin . Sparse distance preservers and additive spanners . In Symposium on Discrete Algorithms (SODA) , 2003 . B. Bollob\u00e1s, D. Coppersmith, and M. L. Elkin. Sparse distance preservers and additive spanners. In Symposium on Discrete Algorithms (SODA), 2003."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972863.12"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_24"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281112"},{"key":"e_1_3_2_1_16_1","first-page":"379","volume-title":"23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings","author":"Chen W.","year":"2009","unstructured":"W. Chen , C. Sommer , S.-H. Teng , and Y. Wang . Compact routing in power-law graphs. In Distributed Computing , 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings , pages 379 -- 391 , 2009 . W. Chen, C. Sommer, S.-H. Teng, and Y. Wang. Compact routing in power-law graphs. In Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings, pages 379--391, 2009."},{"key":"e_1_3_2_1_17_1","volume-title":"Additive spanners and distance and routing labeling schemes for hyperbolic graphs","author":"Chepoi V. D.","year":"2009","unstructured":"V. D. Chepoi , F. F. Dragan , B. Estellon , M. Habib , and Y. Vax\u00e8s . Additive spanners and distance and routing labeling schemes for hyperbolic graphs , 2009 . preprint. V. D. Chepoi, F. F. Dragan, B. Estellon, M. Habib, and Y. Vax\u00e8s. Additive spanners and distance and routing labeling schemes for hyperbolic graphs, 2009. preprint."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.07.011"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794261295"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1134"},{"key":"e_1_3_2_1_21_1","first-page":"840","volume-title":"14th Symposium on Discrete Algorithms (SODA)","author":"Demaine E. D.","year":"2004","unstructured":"E. D. Demaine and M. Hajiaghayi . Equivalence of local treewidth and linear local treewidth and its algorithmic applications . In 14th Symposium on Discrete Algorithms (SODA) , pages 840 -- 849 . ACM-SIAM, Jan. 2004 . E. D. Demaine and M. Hajiaghayi. Equivalence of local treewidth and linear local treewidth and its algorithmic applications. In 14th Symposium on Discrete Algorithms (SODA), pages 840--849. ACM-SIAM, Jan. 2004."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_27"},{"key":"e_1_3_2_1_23_1","first-page":"365","volume-title":"18th International Conference, DISC 2004, Amsterdam, The Netherlands, October 4-7, 2004","author":"Dourisboure Y.","year":"2004","unstructured":"Y. Dourisboure . Compact routing schemes for bounded tree-length graphs and for k-chordal graphs. In Distributed Computing , 18th International Conference, DISC 2004, Amsterdam, The Netherlands, October 4-7, 2004 , Proceedings , pages 365 -- 378 , 2004 . Y. Dourisboure. Compact routing schemes for bounded tree-length graphs and for k-chordal graphs. In Distributed Computing, 18th International Conference, DISC 2004, Amsterdam, The Netherlands, October 4-7, 2004, Proceedings, pages 365--378, 2004."},{"key":"e_1_3_2_1_24_1","first-page":"252","volume-title":"16th International Conference, DISC 2002, Toulouse, France, October 28-30, 2002 Proceedings","author":"Dourisboure Y.","year":"2002","unstructured":"Y. Dourisboure and C. Gavoille . Improved compact routing scheme for chordal graphs. In Distributed Computing , 16th International Conference, DISC 2002, Toulouse, France, October 28-30, 2002 Proceedings , pages 252 -- 264 , 2002 . Y. Dourisboure and C. Gavoille. Improved compact routing scheme for chordal graphs. In Distributed Computing, 16th International Conference, DISC 2002, Toulouse, France, October 28-30, 2002 Proceedings, pages 252--264, 2002."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.03.011"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30559-0_6"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701393384"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.76"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010020"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/05064299X"},{"key":"e_1_3_2_1_31_1","first-page":"757","volume-title":"28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001","author":"Fraigniaud P.","year":"2001","unstructured":"P. Fraigniaud and C. Gavoille . Routing in trees. In Automata, Languages and Programming , 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001 , Proceedings , pages 757 -- 772 , 2001 . P. Fraigniaud and C. Gavoille. Routing in trees. In Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pages 757--772, 2001."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/646516.696161"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.163"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01762113"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/568438.568451"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1705"},{"key":"e_1_3_2_1_37_1","first-page":"351","volume-title":"26th International Colloquium, ICALP'99","author":"Gavoille C.","year":"1999","unstructured":"C. Gavoille and N. Hanusse . Compact routing tables for graphs of bounded genus. In Automata, Languages and Programming , 26th International Colloquium, ICALP'99 , Prague, Czech Republic , July 11-15, 1999 , Proceedings, pages 351 -- 360 , 1999. C. Gavoille and N. Hanusse. Compact routing tables for graphs of bounded genus. In Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pages 351--360, 1999."},{"key":"e_1_3_2_1_38_1","first-page":"476","volume-title":"9th Annual European Symposium","author":"Gavoille C.","year":"2001","unstructured":"C. Gavoille , M. Katz , N. A. Katz , C. Paul , and D. Peleg . Approximate distance labeling schemes. In Algorithms - ESA 2001 , 9th Annual European Symposium , Aarhus, Denmark , August 28-31, 2001 , Proceedings, pages 476 -- 487 , 2001. C. Gavoille, M. Katz, N. A. Katz, C. Paul, and D. Peleg. Approximate distance labeling schemes. In Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, pages 476--487, 2001."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799351717"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.05.002"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248075"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/343477.362158"},{"key":"e_1_3_2_1_43_1","first-page":"196","volume-title":"17th International Conference, DISC 2003, Sorrento, Italy, October 1-3, 2003","author":"Iwama K.","year":"2003","unstructured":"K. Iwama and M. Okita . Compact routing for flat networks. In Distributed Computing , 17th International Conference, DISC 2003, Sorrento, Italy, October 1-3, 2003 , Proceedings , pages 196 -- 210 , 2003 . K. Iwama and M. Okita. Compact routing for flat networks. In Distributed Computing, 17th International Conference, DISC 2003, Sorrento, Italy, October 1-3, 2003, Proceedings, pages 196--210, 2003."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.45"},{"key":"e_1_3_2_1_45_1","first-page":"939","volume-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007","author":"Konjevod G.","year":"2007","unstructured":"G. Konjevod , A. W. Richa , and D. Xia . Optimal scale-free compact routing schemes in networks of low doubling dimension . In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 , New Orleans, Louisiana, USA , January 7-9, 2007 , pages 939 -- 948 , 2007. G. Konjevod, A. W. Richa, and D. Xia. Optimal scale-free compact routing schemes in networks of low doubling dimension. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pages 939--948, 2007."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0929"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.02.015"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265907002004"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/646720.702375"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(200003)33:3%26lt;%26gt;1.0.CO;2-Y"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130114"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/65950.65953"},{"key":"e_1_3_2_1_53_1","first-page":"78","volume-title":"34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007","author":"Pettie S.","year":"2007","unstructured":"S. Pettie . Low distortion spanners. In Automata, Languages and Programming , 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007 , Proceedings , pages 78 -- 89 , 2007 . S. Pettie. Low distortion spanners. In Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pages 78--89, 2007."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039493"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378581"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109645"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.45"},{"key":"e_1_3_2_1_59_1","series-title":"Lecture Notes in Computer Science (ARCoSS)","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/978-3-642-14165-2_40","volume-title":"37th International Colloquium on Automata, Languages and Programming (ICALP)","author":"Woodruff D. P.","year":"2010","unstructured":"D. P. Woodruff . Additive spanners in nearly quadratic time. In 37th International Colloquium on Automata, Languages and Programming (ICALP) , volume 6198 of Lecture Notes in Computer Science (ARCoSS) , pages 463 -- 474 . Springer , July 2010 . D. P. Woodruff. Additive spanners in nearly quadratic time. In 37th International Colloquium on Automata, Languages and Programming (ICALP), volume 6198 of Lecture Notes in Computer Science (ARCoSS), pages 463--474. Springer, July 2010."}],"event":{"name":"SPAA '11: 23rd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"San Jose California USA","acronym":"SPAA '11"},"container-title":["Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1989493.1989526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T15:52:27Z","timestamp":1673020347000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989493.1989526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,4]]},"references-count":59,"alternative-id":["10.1145\/1989493.1989526","10.1145\/1989493"],"URL":"https:\/\/doi.org\/10.1145\/1989493.1989526","relation":{},"subject":[],"published":{"date-parts":[[2011,6,4]]},"assertion":[{"value":"2011-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}