TY - JOUR

T1 - The hardness of approximating spanner problems

AU - Elkin, Michael

AU - Peleg, David

N1 - Funding Information:
∗ This work by Michael Elkin was done in the Weizmann Institute of Science, Rehovot, Israel. David Peleg was supported in part by grants from the Israel Science Foundation and the Israel Ministry of Science and Art.

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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(2log1-εn))[27]. 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 = Ω(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(n1-σ), 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.

AB - 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(2log1-εn))[27]. 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 = Ω(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(n1-σ), 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.

UR - http://www.scopus.com/inward/record.url?scp=36849000757&partnerID=8YFLogxK

U2 - 10.1007/s00224-006-1266-2

DO - 10.1007/s00224-006-1266-2

M3 - Article

AN - SCOPUS:36849000757

SN - 1432-4350

VL - 41

SP - 691

EP - 729

JO - Theory of Computing Systems

JF - Theory of Computing Systems

IS - 4

ER -