{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:51:21Z","timestamp":1744217481698,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315930"},{"type":"electronic","value":"9783642315947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31594-7_25","type":"book-chapter","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T21:20:21Z","timestamp":1340400021000},"page":"290-301","source":"Crossref","is-referenced-by-count":1,"title":["Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner"],"prefix":"10.1007","author":[{"given":"Michael","family":"Dinitz","sequence":"first","affiliation":[]},{"given":"Guy","family":"Kortsarz","sequence":"additional","affiliation":[]},{"given":"Ran","family":"Raz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"25_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 Comput. Geom.\u00a09(1), 81\u2013100 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"25_CR2","unstructured":"Arora, S., Lund, C.: Hardness on Approximation. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, ch. 10. PWS Publishing (1996)"},{"issue":"3","key":"25_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"J. ACM"},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of np. J. ACM\u00a045(1), 70\u2013122 (1998)","journal-title":"J. ACM"},{"issue":"4","key":"25_CR5","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 $^{\\mbox{2}}$ ) time. ACM Transactions on Algorithms\u00a02(4), 557\u2013577 (2006)","journal-title":"ACM Transactions on Algorithms"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22006-7_1","volume-title":"Automata, Languages and Programming","author":"P. Berman","year":"2011","unstructured":"Berman, P., Bhattacharyya, A., Makarychev, K., Raskhodnikova, S., Yaroslavtsev, G.: Improved Approximation for the Directed Spanner Problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol.\u00a06755, pp. 1\u201312. Springer, Heidelberg (2011)"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Bhattacharyya, A., Grigorescu, E., Jung, K., Raskhodnikova, S., Woodruff, D.P.: Transitive-closure spanners. In: SODA 2009, pp. 932\u2013941 (2009)","DOI":"10.1137\/1.9781611973068.101"},{"issue":"1","key":"25_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. J. ACM\u00a047(1), 132\u2013166 (2000)","journal-title":"J. ACM"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Dinitz, M., Krauthgamer, R.: Directed spanners via flow-based linear programs. In: STOC 2011, pp. 323\u2013332 (2011)","DOI":"10.1145\/1993636.1993680"},{"key":"25_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274","volume-title":"Concentration of Measure for the Analysis of Randomized Algorithms","author":"D. Dubhashi","year":"2009","unstructured":"Dubhashi, D., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, New York (2009)"},{"key":"25_CR11","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)"},{"issue":"1-3","key":"25_CR12","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>\u20092. Theor. Comput. Sci.\u00a0337(1-3), 249\u2013277 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"25_CR13","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":"25_CR14","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":"25_CR15","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/1162349.1162351","volume":"53","author":"O. Goldreich","year":"2006","unstructured":"Goldreich, O., Sudan, M.: Locally testable codes and pcps of almost-linear length. J. ACM\u00a053, 558\u2013655 (2006)","journal-title":"J. ACM"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the unique games conjecture. In: FOCS 2005, p. 3 (2005)","DOI":"10.1109\/SFCS.2005.61"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Kortsarz, G.: On the hardness of approximating spanners. Algorithmica\u00a01444 (1998)","DOI":"10.1007\/BFb0053970"},{"issue":"2","key":"25_CR18","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. Journal of Algorithms\u00a017(2), 222\u2013236 (1994)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"25_CR19","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01758846","volume":"8","author":"C. Levcopoulos","year":"1992","unstructured":"Levcopoulos, C., Lingas, A.: There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica\u00a08(3), 251\u2013256 (1992)","journal-title":"Algorithmica"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Schaffer, A.: Graph spanners. J. Graph Theory\u00a013, 99\u2013116 (1989)","journal-title":"J. Graph Theory"},{"issue":"4","key":"25_CR21","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":"25_CR22","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. J. ACM\u00a036(3), 510\u2013530 (1989)","journal-title":"J. ACM"},{"issue":"3","key":"25_CR23","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/S0097539795280895","volume":"27","author":"R. Raz","year":"1998","unstructured":"Raz, R.: A parallel repetition theorem. SIAM Journal on Computing\u00a027(3), 763\u2013803 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: SPAA 2001, pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"},{"issue":"1","key":"25_CR25","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. J. ACM\u00a052(1), 1\u201324 (2005)","journal-title":"J. ACM"}],"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-31594-7_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T12:10:53Z","timestamp":1743595853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31594-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315930","9783642315947"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31594-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}