Strong inapproximability of the basic k-spanner problem

Michael Elkin, David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

24 Scopus citations

Abstract

This paper studies the approximability of the sparse k-spanner problem. An O(log n)-ratio approximation algorithm is known for the problem for k = 2. For larger values of k, the problem admits only a weaker O(n1/⌊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(log n), 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 (npolylog 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 < ϵ < 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.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings
EditorsUgo Montanari, Jose D. P. Rolim, Emo Welzl
PublisherSpringer Verlag
Pages636-648
Number of pages13
ISBN (Print)9783540450221
DOIs
StatePublished - 1 Jan 2000
Externally publishedYes
Event27th International Colloquium on Automata, Languages and Programming, ICALP 2000 - Geneva, Switzerland
Duration: 9 Jul 200015 Jul 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1853
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference27th International Colloquium on Automata, Languages and Programming, ICALP 2000
Country/TerritorySwitzerland
CityGeneva
Period9/07/0015/07/00

Fingerprint

Dive into the research topics of 'Strong inapproximability of the basic k-spanner problem'. Together they form a unique fingerprint.

Cite this