Abstract
This paper examines a number of variants of the sparse k-spanner problem, and presents hardness results concerning their approximability. Previously, it was known that most k-spanner problems are weakly inapproximable, namely, are NP-hard to approximate with ratio O(log n), for every k ≥ 2, and that the unit-length k-spanner problem for constant stretch requirement k ≥ 5 is strongly inapproximable, namely, is NP-hard to approximate with ratio O(2log ∈ n) [[19]].
The results of this paper significantly expand the ranges of hardness for k-spanner problems. In general, strong hardness is shown for a number of k-spanner problems, for certain ranges of the stretch requirement k depending on the particular variant at hand. The problems studied differ by the types of edge weights and lengths used, and include also directed, augmentation and client-server variants of the problem.
The paper also considers k-spanner problems in which the stretch requirement k is relaxed (e.g., k = Ω(log n)). For these cases, no inapproximability results were known at all (even for a constant approximation ratio) for any spanner problem. Moreover, some versions of the k-spanner problem are known to enjoy the ratio degradation property, namely, their complexity decreases exponentially with the inverse of the stretch requirement. So far, no hardness result existed precluding any k-spanner problem from enjoying this property. This paper establishes strong inapproximability results for the case of relaxed stretch requirement (up to k = o(n δ), for any 0 < δ < 1), for a large variety of k-spanner problems. It is also shown that these problems do not enjoy the ratio degradation property.
Supported in part by a Leo Frances Gallin Scholarship.
Supported in part by grants from the Israel Ministry of Science and Art.
This is a preview of subscription content, log in via an institution to check access.
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 and D. Joseph, Generating sparse spanners for weighted graphs, Proc. 2nd Scandinavian Workshop on Algorithm Theory, Lect. Notes in Comput. Sci., Vol. 447, pp. 26–37, Springer-Verlag, New York/Berlin, 1990.
Baruch Awerbuch, Alan Baratz, and David Peleg. Efficient broadcast and lightweight spanners. Unpublished manuscript, November 1991.
B. Bollobas, Extremal Graph Theory. Academic Press, 1978.
L. Cai, Tree-2-Spanners, Technical Report 91-4, Simon Fraser University, 1991.
R. D. Carr, S. Doddi, G. Konjevod, M. V. Marathe On the Red-Blue Set Cover Problem, Los Alamos National Laboratory.
P. Chanas, Dimensionnement de réseaux ATM, PhD thesis, CNET Sophia, Sept. 1998.
B. Chandra, G. Das, G. Narasimhan and J. Soares, New Sparseness Results on Graph Spanners, Proc 8th ACM Symposium on Computational Geometry, pages 192–201, 1992.
L.P. Chew, There is a planar graph almost as good as the complete graph, Proc. ACM Symp. on Computational Geometry, 1986, pp. 169–177
G. Das and D. Joseph, Which triangulation approximates the complete graphs, Proc. Int. Symp. on Optimal Algorithms, Lect. Notes in Comput. Sci., Vol. 401, pp. 168–192, Springer-Verlag, New York/Berlin, 1989
I. Dinur and S. Safra, On the hardness of Approximating Label Cover, Electronic Colloquium on Computational Complexity, Report No. 15 (1999)
D.P. Dobkin, S.J. Friedman and K.J. Supowit, Delaunay graphs are almost as good as complete graphs, Proc. 31st IEEE Symp. on Foundations of Computer Science, 1987, pp. 20–26.
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, Technical Report MCS99-14, the Weizmann Institute of Science, 1999.
M.-L. Elkin and D. Peleg, The Client-Server 2-Spanner Problem and Applications to Network Design, Technical Report MCS99-24, the Weizmann Institute of Science, 1999.
M.-L. Elkin and D. Peleg, Classification of Spanner Problems, in preparation.
M.-L. Elkin and D. Peleg, Strong Inapproximability of the Basic k-Spanner Problem, Technical Report MCS99-23, the Weizmann Institute of Science, 1999.
U. Feige and L. Lovasz, Two prover one-round proof systems: Their power and their problems, Proc. 24th ACM Symp. on Theory of Computing, 733–741, 1992
D. Hochbaum Approximation Algorithms for NP-hard Problems, PWS Publishing Company, Boston, 1997.
G. Kortsarz, On the Hardness of Approximating Spanners, Proc. APPROX., Lect. Notes in Comput. Sci., 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.
C. Levcopoulos and A. Lingas, There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees, Proc. Int. Symp. on Optimal Algorithms, Lect. Notes in Comput. Sci., Vol. 401, pp. 9–13, Springer-Verlag, New York/Berlin, 1989
A.L. Liestman and T. Shermer, Grid Spanners, Networks 23 (1993), 123–133.
D. Peleg, Locality-Sensitive Distributed Computing, unpublished manuscript, 1999.
D. Peleg and A. Schäffer, Graph Spanners, J. Graph Theory 13 (1989), 99–116.
D. Peleg and J.D. Ullman, An optimal synchronizer for the hypercube, SIAM J. Computing 18 (1989), pp. 740–747.
H. Regev, The weight of the Greedy Graph Spanner, Technical Report CS95-22, July 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). The Hardness of Approximating Spanner Problems. In: Reichel, H., Tison, S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46541-3_31
Download citation
DOI: https://doi.org/10.1007/3-540-46541-3_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67141-1
Online ISBN: 978-3-540-46541-6
eBook Packages: Springer Book Archive