{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T00:21:42Z","timestamp":1782778902838,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642153686","type":"print"},{"value":"9783642153693","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15369-3_34","type":"book-chapter","created":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T04:01:36Z","timestamp":1282881696000},"page":"448-461","source":"Crossref","is-referenced-by-count":8,"title":["Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners"],"prefix":"10.1007","author":[{"given":"Arnab","family":"Bhattacharyya","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elena","family":"Grigorescu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Madhav","family":"Jha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kyomin","family":"Jung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sofya","family":"Raskhodnikova","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David P.","family":"Woodruff","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"34_CR1","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. Journal of Graph Theory\u00a013, 99\u2013116 (1989)","journal-title":"Journal of Graph Theory"},{"key":"34_CR2","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, 170\u2013183 (2001)","journal-title":"J. Algorithms"},{"key":"34_CR3","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, 79\u201395 (2004)","journal-title":"J. Algorithms"},{"key":"34_CR4","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, 510\u2013530 (1989)","journal-title":"JACM"},{"key":"34_CR5","unstructured":"Roditty, L., Thorup, M., Zwick, U.: Roundtrip spanners and roundtrip routing in directed graphs. In: SODA, pp. 844\u2013851 (2002)"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: ACM Symposium on Parallel Algorithms and Architectures, pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"},{"key":"34_CR7","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, 740\u2013747 (1989)","journal-title":"SIAM J. Comput."},{"key":"34_CR8","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, 210\u2013236 (1998)","journal-title":"SIAM J. Comput."},{"key":"34_CR9","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, 132\u2013166 (2000)","journal-title":"JACM"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Elkin, M.: Computing almost shortest paths. In: PODC, pp. 53\u201362 (2001)","DOI":"10.1145\/383962.383983"},{"key":"34_CR11","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, 557\u2013577 (2006)","journal-title":"ACM Transactions on Algorithms"},{"key":"34_CR12","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\u201324 (2005)","journal-title":"JACM"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Bhattacharyya, A., Grigorescu, E., Jung, K., Raskhodnikova, S., Woodruff, D.P.: Transitive-closure spanners. In: SODA, pp. 932\u2013941 (2009)","DOI":"10.1137\/1.9781611973068.101"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"2897","DOI":"10.1137\/080728561","volume":"39","author":"M. Saks","year":"2010","unstructured":"Saks, M., Seshadhri, C.: Local monotonicity reconstruction. SIAM Journal on Computing\u00a039, 2897\u20132926 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"34_CR15","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/s00453-007-9075-9","volume":"51","author":"N. Ailon","year":"2008","unstructured":"Ailon, N., Chazelle, B., Comandur, S., Liu, D.: Property-preserving data reconstruction. Algorithmica\u00a051, 160\u2013182 (2008)","journal-title":"Algorithmica"},{"key":"34_CR16","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s004930070011","volume":"20","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O., Goldwasser, S., Lehman, E., Ron, D., Samorodnitsky, A.: Testing monotonicity. Combinatorica\u00a020, 301\u2013337 (2000)","journal-title":"Combinatorica"},{"key":"34_CR17","series-title":"Lecture Notes in Computer Science","first-page":"97","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"Y. Dodis","year":"1997","unstructured":"Dodis, Y., Goldreich, O., Lehman, E., Raskhodnikova, S., Ron, D., Samorodnitsky, A.: Improved testing algorithms for monotonicity. In: Rolim, J.D.P. (ed.) RANDOM 1997. LNCS, vol.\u00a01269, pp. 97\u2013108. Springer, Heidelberg (1997)"},{"key":"34_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/3-540-56402-0_48","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Thorup","year":"1993","unstructured":"Thorup, M.: On shortcutting digraphs. In: Mayr, E.W. (ed.) WG 1992. LNCS, vol.\u00a0657, pp. 205\u2013211. Springer, Heidelberg (1993)"},{"key":"34_CR19","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1017\/S0963548300001668","volume":"4","author":"M. Thorup","year":"1995","unstructured":"Thorup, M.: Shortcutting planar digraphs. Combinatorics, Probability & Computing\u00a04, 287\u2013315 (1995)","journal-title":"Combinatorics, Probability & Computing"},{"key":"34_CR20","unstructured":"Hesse, W.: Directed graphs requiring large numbers of shortcuts. In: SODA, pp. 665\u2013669 (2003)"},{"key":"34_CR21","unstructured":"Alon, N., Schieber, B.: Optimal preprocessing for answering on-line product queries. Technical Report 71\/87, Tel-Aviv University (1987)"},{"key":"34_CR22","doi-asserted-by":"crossref","unstructured":"Atallah, M.J., Frikken, K.B., Fazio, N., Blanton, M.: Dynamic and efficient key management for access hierarchies. In: ACM Conference on Computer and Communications Security, pp. 190\u2013202 (2005)","DOI":"10.1145\/1102120.1102147"},{"key":"34_CR23","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF01840366","volume":"2","author":"B. Chazelle","year":"1987","unstructured":"Chazelle, B.: Computing on a free tree via complexity-preserving mappings. Algorithmica\u00a02, 337\u2013361 (1987)","journal-title":"Algorithmica"},{"key":"34_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Space-time tradeoff for answering range queries (extended abstract). In: STOC, pp. 128\u2013136 (1982)","DOI":"10.1145\/800070.802185"},{"key":"34_CR25","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/jagm.1996.0829","volume":"23","author":"M. Thorup","year":"1997","unstructured":"Thorup, M.: Parallel shortcutting of rooted trees. J. Algorithms\u00a023, 139\u2013159 (1997)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15369-3_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:05:27Z","timestamp":1606187127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15369-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153686","9783642153693"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15369-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}