{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:54Z","timestamp":1759637754525},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642220050"},{"type":"electronic","value":"9783642220067"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22006-7_1","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T03:44:05Z","timestamp":1308541445000},"page":"1-12","source":"Crossref","is-referenced-by-count":8,"title":["Improved Approximation for the Directed Spanner Problem"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnab","family":"Bhattacharyya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantin","family":"Makarychev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sofya","family":"Raskhodnikova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grigory","family":"Yaroslavtsev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I. Alth\u00f6fer","year":"1993","unstructured":"Alth\u00f6fer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete & Computational Geometry\u00a09(1), 81\u2013100 (1993)","journal-title":"Discrete & Computational Geometry"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B.: Communication-time trade-offs in network synchronization. In: PODC, pp. 272\u2013276 (1985)","DOI":"10.1145\/323596.323621"},{"issue":"4","key":"1_CR3","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1198513.1198518","volume":"2","author":"S. Baswana","year":"2006","unstructured":"Baswana, S., Sen, S.: Approximate distance oracles for unweighted graphs in expected $\\tilde{O} (n^2)$ time. ACM Transactions on Algorithms\u00a02(4), 557\u2013577 (2006)","journal-title":"ACM Transactions on Algorithms"},{"key":"1_CR4","unstructured":"Berman, P., Raskhodnikova, S., Ruan, G.: Finding sparser directed spanners. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS. LIPIcs, vol.\u00a08, pp. 424\u2013435. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-642-15369-3_34","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Bhattacharyya","year":"2010","unstructured":"Bhattacharyya, A., Grigorescu, E., Jha, M., Jung, K., Raskhodnikova, S., Woodruff, D.P.: Lower bounds for local monotonicity reconstruction from transitive-closure spanners. In: Serna, M.J., Shaltiel, R., Jansen, K., Rolim, J.D.P. (eds.) APPROX 2010, LNCS, vol.\u00a06302, pp. 448\u2013461. Springer, Heidelberg (2010)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Bhattacharyya, A., Grigorescu, E., Jung, K., Raskhodnikova, S., Woodruff, D.: Transitive-closure spanners. In: SODA, pp. 932\u2013941 (2009)","DOI":"10.1137\/1.9781611973068.101"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0097539794261295","volume":"28","author":"E. Cohen","year":"1998","unstructured":"Cohen, E.: Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Comput.\u00a028(1), 210\u2013236 (1998)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/331605.331610","volume":"47","author":"E. Cohen","year":"2000","unstructured":"Cohen, E.: Polylog-time and near-linear work approximation scheme for undirected shortest paths. JACM\u00a047(1), 132\u2013166 (2000)","journal-title":"JACM"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1006\/jagm.2000.1134","volume":"38","author":"L. Cowen","year":"2001","unstructured":"Cowen, L.: Compact routing with minimum stretch. J. Algorithms\u00a038(1), 170\u2013183 (2001)","journal-title":"J. Algorithms"},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jalgor.2003.08.001","volume":"50","author":"L. Cowen","year":"2004","unstructured":"Cowen, L., Wagner, C.G.: Compact roundtrip routing in directed networks. J. Algorithms\u00a050(1), 79\u201395 (2004)","journal-title":"J. Algorithms"},{"key":"1_CR11","volume-title":"STOC","author":"M. Dinitz","year":"2011","unstructured":"Dinitz, M., Krauthgamer, R.: Directed spanners via flow-based linear programs. In: Vadhan, S. (ed.) STOC. ACM, New York (to appear, 2011)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Khanna, S.: Designing networks with bounded pairwise distance. In: STOC, pp. 750\u2013759 (1999)","DOI":"10.1145\/301250.301447"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Elkin, M.: Computing almost shortest paths. In: PODC, pp. 53\u201362 (2001)","DOI":"10.1145\/383962.383983"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/3-540-45022-X_54","volume-title":"Automata, Languages and Programming","author":"M. Elkin","year":"2000","unstructured":"Elkin, M., Peleg, D.: Strong inapproximability of the basic k-spanner problem. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 636\u2013647. Springer, Heidelberg (2000)"},{"key":"1_CR15","unstructured":"Elkin, M., Peleg, D.: The client-server 2-spanner problem with applications to network design. In: SIROCCO, pp. 117\u2013132 (2001)"},{"issue":"1-3","key":"1_CR16","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.tcs.2004.11.022","volume":"337","author":"M. Elkin","year":"2005","unstructured":"Elkin, M., Peleg, D.: Approximating k-spanner problems for k\u2009\u2265\u20092. Theor. Comput. Sci.\u00a0337(1-3), 249\u2013277 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"1_CR17","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/s00224-006-1266-2","volume":"41","author":"M. Elkin","year":"2007","unstructured":"Elkin, M., Peleg, D.: The hardness of approximating spanner problems. Theory Comput. Syst.\u00a041(4), 691\u2013729 (2007)","journal-title":"Theory Comput. Syst."},{"issue":"5","key":"1_CR18","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1137\/070683155","volume":"38","author":"J. Feigenbaum","year":"2008","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: Graph distances in the data-stream model. SIAM J. Comput.\u00a038(5), 1709\u20131727 (2008)","journal-title":"SIAM J. Comput."},{"key":"1_CR19","first-page":"922","volume-title":"SODA","author":"M. Feldman","year":"2009","unstructured":"Feldman, M., Kortsarz, G., Nutov, Z.: Improved approximating algorithms for Directed Steiner Forest. In: Mathieu, C. (ed.) SODA, pp. 922\u2013931. SIAM, Philadelphia (2009)"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Jha, M., Raskhodnikova, S.: Testing and reconstruction of Lipschitz functions with applications to data privacy. Electronic Colloquium on Computational Complexity (ECCC) TR11-057 (2011)","DOI":"10.1109\/FOCS.2011.13"},{"issue":"2","key":"1_CR21","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1006\/jagm.1994.1032","volume":"17","author":"G. Kortsarz","year":"1994","unstructured":"Kortsarz, G., Peleg, D.: Generating sparse 2-spanners. J. Algorithms\u00a017(2), 222\u2013236 (1994)","journal-title":"J. Algorithms"},{"issue":"3","key":"1_CR22","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/s00453-001-0021-y","volume":"30","author":"G. Kortsarz","year":"2001","unstructured":"Kortsarz, G.: On the hardness of approximating spanners. Algorithmica\u00a030(3), 432\u2013450 (2001)","journal-title":"Algorithmica"},{"issue":"1","key":"1_CR23","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Sch\u00e4ffer, A.A.: Graph spanners. J. Graph Theory\u00a013(1), 99\u2013116 (1989)","journal-title":"J. Graph Theory"},{"issue":"4","key":"1_CR24","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1137\/0218050","volume":"18","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. SIAM J. Comput.\u00a018(4), 740\u2013747 (1989)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1_CR25","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Upfal, E.: A trade-off between space and efficiency for routing tables. JACM\u00a036(3), 510\u2013530 (1989)","journal-title":"JACM"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-16367-8_10","volume-title":"Property Testing","author":"S. Raskhodnikova","year":"2010","unstructured":"Raskhodnikova, S.: Transitive-closure spanners: a survey. In: Goldreich, O. (ed.) Property Testing. LNCS, vol.\u00a06390, pp. 167\u2013196. Springer, Heidelberg (2010)"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Roditty, L., Thorup, M., Zwick, U.: Roundtrip spanners and roundtrip routing in directed graphs. ACM Transactions on Algorithms\u00a04(3) (2008)","DOI":"10.1145\/1367064.1367069"},{"key":"1_CR28","first-page":"1","volume-title":"SPAA","author":"M. Thorup","year":"2001","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: SPAA, pp. 1\u201310. ACM, New York (2001)"},{"issue":"1","key":"1_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044731.1044732","volume":"52","author":"M. Thorup","year":"2005","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. JACM\u00a052(1), 1\u201324 (2005)","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22006-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T21:47:59Z","timestamp":1560289679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22006-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220050","9783642220067"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22006-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}