Abstract
This paper studies the approximability of the sparse k-spanner problem. An O(logn)-ratio approximation algorithm is known for the problem for k = 2. For larger values of k, the problem admits only a weaker O(n 1/[k]-approximation ratio algorithm [14]. On the negative side, it is known that the k-spanner problem is weakly inapproximable, namely, it is NP-hard to approximate the problem with ratio O(logn), for every k ≥ 2 [11]. This lower bound is tight for k = 2 but leaves a considerable gap for small constants k > 2.
This paper considerably narrows the gap by presenting a strong(or Class III [10])inapproximability result for the problem for any constant k > 2, namely, showing that the problem is inapproximable within a ratio of O(2logεn), for any fixed 0 < ε < 1, unless NP⊆DTIME(n polylog n). Hence the k-spanner problem exhibits a “jump” in its inapproximability once the required stretch is increased from k = 2 to k = 2 +δ.
This hardness result extends into a result of O(2logεn)-inapproximability for the k-spanner problem for k = logμ n and 0 < e < 1 - μ, for any 0 < μ < 1. This result is tight, in view of the O(2log1-μn)-approximation ratio for the problem, implied by the algorithm of [14] for the case k = logμ n. To the best of our knowledge, this is the first example for a set of Class III problems for which the upper and lower bounds “converge” in this sense.
Our main result implies also the same hardness for some other variants of the problem whose strong inapproximability was not known before, such as the uniform k-spanner problem, the unit-weight k-spanner problem, the 3-spanner augmentation problem and the “all-server” k-spanner problem for any constant k.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Supported in part by a Leo Frances Gallin Scholarship.
Supported in part by grants from the Israel Ministry of Science and Art.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
I. Althöfer, G. Das, D. Dobkin, D. Joseph and J. Soares”, On Sparse Spanners of Weighted Graphs, Discrete & Computational Geometry, 9, (1993), pp. 81–100
Baruch Awerbuch, Alan Baratz, and David Peleg. Efficient broadcast and lightweight spanners. Technical Report CS92-22, Weizmann Institute, October 1992.
B. Bollobas, Extremal Graph Theory. Academic Press, 1978.
Robert Carr, Srinivas Doddi, Goran Konjevod, and Madhav Marathe. On the red-blue set cover problem. In Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, 2000.
B. Chandra, G. Das, G. Narasimhan and J. Soares, New Sparseness Results on Graph Spanners, Proc 8th ACM Symp. on Computat. Geometry, 192–201, 1992.
I. Dinur and S. Safra, On the hardness of Approximating Label Cover, Electronic Colloquium on Computational Complexity, Report No. 15 (1999)
Y. Dodis and S. Khanna, Designing Networks with Bounded Pairwise Distance, Proc. 30th ACM Ann. Symp. of Theory of Computing, 1999.
M.-L. Elkin and D. Peleg, The Hardness of Approximating Spanner Problems, Proc. 17th Symp. on Theoretical Aspects of Computer Science, Lille, France, 2000.
M.-L. Elkin and D. Peleg, The Client-Server 2-Spanner Problem and Applications to Network Design, Technical Report MCS99-24, the Weizmann Institute, 1999.
D. Hochbaum Approximation Algorithms for NP-hard Problems, PWS Publishing Company, Boston, 1997.
G. Kortsarz, On the Hardness of Approximating Spanners, Proc. APPROX., LNCS, Vol. 1444, pp. 135–146, Springer-Verlag, New York/Berlin, 1998.
G. Kortsarz and D. Peleg, Generating Sparse 2-Spanners. J. Algorithms, 17 (1994) 222–236.
D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM, Philadelphia, PA, 2000, in press.
D. Peleg and A. Schäffer, Graph Spanners, J. Graph Theory 13 (1989), 99–116.
C. Papadimitriou and M. Yannakakis. Optimization, Approximation and Complexity Classes, J. of Computer and System Sciences, 43, 1991, pp. 425–440.
R. Raz, A parallel repetition theorem. Proc. 27th ACM STOC pp. 447–456, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elkin, M., Peleg, D. (2000). Strong Inapproximability of the Basic k-Spanner Problem. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds) Automata, Languages and Programming. ICALP 2000. Lecture Notes in Computer Science, vol 1853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45022-X_54
Download citation
DOI: https://doi.org/10.1007/3-540-45022-X_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67715-4
Online ISBN: 978-3-540-45022-1
eBook Packages: Springer Book Archive