Abstract
We study the well-known Label Cover problem under the additional requirement that problem instances have large girth. We show that if the girth is some k, the problem is roughly \(2^{(\log^{1-\epsilon} n)/k}\) hard to approximate for all constant ε > 0. A similar theorem was claimed by Elkin and Peleg [ICALP 2000] as part of an attempt to prove hardness for the basic k-spanner problem, but their proof was later found to have a fundamental error. Thus we give both the first non-trivial lower bound for the problem of Label Cover with large girth as well as the first full proof of strong hardness for the basic k-spanner problem, which is both the simplest problem in graph spanners and one of the few for which super-logarithmic hardness was not known. Assuming \(NP \not\subseteq BPTIME(2^{polylog(n)})\), we show (roughly) that for every k ≥ 3 and every constant ε > 0 it is hard to approximate the basic k-spanner problem within a factor better than \(2^{(\log^{1-\epsilon} n) / k}\). This improves over the previous best lower bound of only Ω(logn)/k from [17]. Our main technique is subsampling the edges of 2-query PCPs, which allows us to reduce the degree of a PCP to be essentially equal to the soundness desired. This turns out to be enough to basically guarantee large girth.
Full version available at http://arxiv.org/abs/1203.0224
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Althöfer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete Comput. Geom. 9(1), 81–100 (1993)
Arora, S., Lund, C.: Hardness on Approximation. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, ch. 10. PWS Publishing (1996)
Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501–555 (1998)
Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of np. J. ACM 45(1), 70–122 (1998)
Baswana, S., Sen, S.: Approximate distance oracles for unweighted graphs in expected o(n \(^{\mbox{2}}\)) time. ACM Transactions on Algorithms 2(4), 557–577 (2006)
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. 6755, pp. 1–12. Springer, Heidelberg (2011)
Bhattacharyya, A., Grigorescu, E., Jung, K., Raskhodnikova, S., Woodruff, D.P.: Transitive-closure spanners. In: SODA 2009, pp. 932–941 (2009)
Cohen, E.: Polylog-time and near-linear work approximation scheme for undirected shortest paths. J. ACM 47(1), 132–166 (2000)
Dinitz, M., Krauthgamer, R.: Directed spanners via flow-based linear programs. In: STOC 2011, pp. 323–332 (2011)
Dubhashi, D., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, New York (2009)
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. 1853, pp. 636–647. Springer, Heidelberg (2000)
Elkin, M., Peleg, D.: Approximating k-spanner problems for k > 2. Theor. Comput. Sci. 337(1-3), 249–277 (2005)
Elkin, M., Peleg, D.: The hardness of approximating spanner problems. Theory Comput. Syst. 41(4), 691–729 (2007)
Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: Graph distances in the data-stream model. SIAM J. Comput. 38(5), 1709–1727 (2008)
Goldreich, O., Sudan, M.: Locally testable codes and pcps of almost-linear length. J. ACM 53, 558–655 (2006)
Khot, S.: On the unique games conjecture. In: FOCS 2005, p. 3 (2005)
Kortsarz, G.: On the hardness of approximating spanners. Algorithmica 1444 (1998)
Kortsarz, G., Peleg, D.: Generating sparse 2-spanners. Journal of Algorithms 17(2), 222–236 (1994)
Levcopoulos, C., Lingas, A.: There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica 8(3), 251–256 (1992)
Peleg, D., Schaffer, A.: Graph spanners. J. Graph Theory 13, 99–116 (1989)
Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. SIAM J. Comput. 18(4), 740–747 (1989)
Peleg, D., Upfal, E.: A trade-off between space and efficiency for routing tables. J. ACM 36(3), 510–530 (1989)
Raz, R.: A parallel repetition theorem. SIAM Journal on Computing 27(3), 763–803 (1998)
Thorup, M., Zwick, U.: Compact routing schemes. In: SPAA 2001, pp. 1–10 (2001)
Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM 52(1), 1–24 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dinitz, M., Kortsarz, G., Raz, R. (2012). Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds) Automata, Languages, and Programming. ICALP 2012. Lecture Notes in Computer Science, vol 7391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31594-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-31594-7_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31593-0
Online ISBN: 978-3-642-31594-7
eBook Packages: Computer ScienceComputer Science (R0)