Back to Search Start Over

The Hardness of Approximating Spanner Problems.

Authors :
Elkin, Michael
Peleg, David
Source :
Theory of Computing Systems; Dec2007, Vol. 41 Issue 4, p691-729, 39p, 1 Diagram, 1 Chart
Publication Year :
2007

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, they 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, it is NP-hard to approximate with ratio $O(2^{{\log}^{1 - \epsilon} n})$ ). 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 they include directed, augmentation and client-server variants. The paper also considers k-spanner problems in which the stretch requirement k is relaxed (e.g., $k = \Omega(\log n))$ . For these cases, no inapproximability results were known (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^{{1 - \delta}})$ , for any $0 < \delta < 1$ ), for a large variety of k-spanner problems. It is also shown that these problems do not enjoy the ratio-degradation property. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
14324350
Volume :
41
Issue :
4
Database :
Complementary Index
Journal :
Theory of Computing Systems
Publication Type :
Academic Journal
Accession number :
27734039
Full Text :
https://doi.org/10.1007/s00224-006-1266-2