{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T21:05:05Z","timestamp":1753736705859},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_3","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T07:34:01Z","timestamp":1234251241000},"page":"32-43","source":"Crossref","is-referenced-by-count":6,"title":["Approximating Shortest Paths in Graphs"],"prefix":"10.1007","author":[{"given":"Sandeep","family":"Sen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Awerbuch, B., Baratz, A., Peleg, D.: Efficient broadcast and light weight spanners. Tech. Report CS92-22, Weizmann Institute of Science (1992)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1137\/S0097539796303421","volume":"28","author":"D. Aingworth","year":"1999","unstructured":"Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast estimation of diameter and shortest paths(without matrix multiplication). SIAM Journal on Computing\u00a028, 1167\u20131181 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR3","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.P., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete and Computational Geometry\u00a09, 81\u2013100 (1993)","journal-title":"Discrete and Computational Geometry"},{"issue":"4","key":"3_CR4","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch, B.: Complexity of network synchronization. Journal of Association of Computing Machinery\u00a032(4), 804\u2013823 (1985)","journal-title":"Journal of Association of Computing Machinery"},{"key":"3_CR5","unstructured":"Bollob\u00e1s, B., Coppersmith, D., Elkin, M.: Sparse distance preserves and additive spanners. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 414\u2013423 (2003)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1007\/978-3-540-31856-9_55","volume-title":"STACS 2005","author":"S. Baswana","year":"2005","unstructured":"Baswana, S., Goyal, V., Sen, S.: All-pairs nearly 2-approximate shortest paths in O(n\n                  2polylog n) time. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 666\u2013679. Springer, Heidelberg (2005)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Baswana, S., Gaur, A., Sen, S., Upadhyaya, J.: Distance Oracle for unweighted graphs: breaking the quadratic barrier with constant additive error. In: Proceedings of the ICALP (1) pp. 609\u2013621 (2008)","DOI":"10.1007\/978-3-540-70575-8_50"},{"key":"3_CR8","first-page":"591","volume-title":"Proc. 47th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"S. Baswana","year":"2006","unstructured":"Baswana, S., Kavitha, T.: Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths. In: Proc. 47th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 591\u2013602. IEEE, Los Alamitos (2006)"},{"key":"3_CR9","unstructured":"Baswana, S., Telikepalli, K., Mehlhorn, K., Pettie, S.: New construction of (\u03b1,\u03b2)-spanners and purely additive spanners. In: Proceedings of 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 672\u2013681 (2005)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Baswana, S., Sen, S.: A simple linear time algorithm for computing a (2k\u2009\u2212\u20091)-spanner of O(kn\n                  1\u2009+\u20091\/k\n                  ) size in weighted graphs. In: Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP), pp. 384\u2013396 (2003)","DOI":"10.1007\/3-540-45061-0_32"},{"key":"3_CR11","unstructured":"Baswana, S., Sen, S.: Approximate distance oracles for unweighted graphs in \n                    \n                      \n                    \n                    $\\tilde{O}(n^2)$\n                   time. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 271\u2013280 (2004)"},{"key":"3_CR12","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 O(n\n                  2) time. ACM Transactions on Algorithms\u00a02, 557\u2013577 (2006)","journal-title":"ACM Transactions on Algorithms"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1002\/rsa.20130","volume":"30","author":"S. Baswana","year":"2007","unstructured":"Baswana, S., Sen, S.: A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Structures and Algorithms\u00a030, 532\u2013563 (2007)","journal-title":"Random Structures and Algorithms"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. In: Proceedings of 39th Annual ACM Symposium on Theory of Computing, pp. 590\u2013598 (2007)","DOI":"10.1145\/1250790.1250877"},{"key":"3_CR15","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 Journal on Computing\u00a028, 210\u2013236 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.2000.1117","volume":"38","author":"E. Cohen","year":"2001","unstructured":"Cohen, E., Zwick, U.: All-pairs small stretch paths. Journal of Algorithms\u00a038, 335\u2013353 (2001)","journal-title":"Journal of Algorithms"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation\u00a09, 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computation"},{"key":"3_CR18","volume-title":"Introduction to Algorothms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorothms. MIT Press, Cambridge (1990)"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/S0097539797327908","volume":"29","author":"D. Dor","year":"2000","unstructured":"Dor, D., Halperin, S., Zwick, U.: All pairs almost shortest paths. Siam Journal on Computing\u00a029, 1740\u20131759 (2000)","journal-title":"Siam Journal on Computing"},{"key":"3_CR20","first-page":"282","volume":"1","author":"M. Elkin","year":"2005","unstructured":"Elkin, M.: Computing almost shortest paths. ACM Transactions on Algorithms (TALG)\u00a01, 282\u2013323 (2005)","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Elkin, M., Peleg, D.: Strong inapproximability of the basic k-spanner problem. In: Proc. of 27th International Colloquium on Automata, Languages and Programming, pp. 636\u2013648 (2000)","DOI":"10.1007\/3-540-45022-X_54"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1137\/S0097539701393384","volume":"33","author":"M. Elkin","year":"2004","unstructured":"Elkin, M., Peleg, D.: (1\u2009+\u2009\u03b5,\u03b2)-spanner construction for general graphs. SIAM Journal of Computing\u00a033, 608\u2013631 (2004)","journal-title":"SIAM Journal of Computing"},{"key":"3_CR23","unstructured":"Erd\u0151s, P.: Extremal problems in graph theory. In: Theory of Graphs and its Applications (Proc. Sympos. Smolenice,1963), pp. 29\u201336. Publ. House Czechoslovak Acad. Sci., Prague (1964)"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M.L. Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with O(1) worst case time. Journal of Association of Computing Machinery\u00a031, 538\u2013544 (1984)","journal-title":"Journal of Association of Computing Machinery"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(03)00402-X","volume":"312","author":"S. Pettie","year":"2004","unstructured":"Pettie, S.: A new approach to all-pairs shortest paths on real-weighted graphs. Theoretical Computer Science\u00a0312, 47\u201374 (2004)","journal-title":"Theoretical Computer Science"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Schaffer, A.A.: Graph spanners. Journal of Graph Theory\u00a013, 99\u2013116 (1989)","journal-title":"Journal of Graph Theory"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/11523468_22","volume-title":"Automata, Languages and Programming","author":"L. Roditty","year":"2005","unstructured":"Roditty, L., Thorup, M., Zwick, U.: Deterministic constructions of approximate distance oracles and spanners. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 261\u2013272. Springer, Heidelberg (2005)"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Shoshan, A., Zwick, U.: All pairs shortest paths in undirected graphs with integer weights. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS), pp. 605\u2013615 (1999)","DOI":"10.1109\/SFFCS.1999.814635"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: Proceedings of 13th ACM Symposium on Parallel Algorithms and Architecture, pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"},{"key":"3_CR30","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. Journal of Association of Computing Machinery\u00a052, 1\u201324 (2005)","journal-title":"Journal of Association of Computing Machinery"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Spanners and emulators with sublinear distance errors. In: Proceedings of 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 802\u2013809 (2006)","DOI":"10.1145\/1109557.1109645"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-44676-1_3","volume-title":"Algorithms - ESA 2001","author":"U. Zwick","year":"2001","unstructured":"Zwick, U.: Exact and approximate distances in graphs - A survey. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 33\u201348. Springer, Heidelberg (2001)"},{"key":"3_CR33","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/567112.567114","volume":"49","author":"U. Zwick","year":"2002","unstructured":"Zwick, U.: All-pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of Association of Computing Machinery\u00a049, 289\u2013317 (2002)","journal-title":"Journal of Association of Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T08:08:19Z","timestamp":1551773299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}