On subexponential running times for approximating directed Steiner tree and related problems

11/02/2018 ∙ by Marek Cygan, et al. ∙ Rutgers University 0

This paper concerns proving almost tight (super-polynomial) running times, for achieving desired approximation ratios for various problems. To illustrate, the question we study, let us consider the Set-Cover problem with n elements and m sets. Now we specify our goal to approximate Set-Cover to a factor of (1-d)ln n, for a given parameter 0<d<1. What is the best possible running time for achieving such approximation? This question was answered implicitly in the work of Moshkovitz [Theory of Computing, 2015]: Assuming both the Projection Games Conjecture (PGC) and the Exponential-Time Hypothesis (ETH), any ((1-d) ln n)-approximation algorithm for Set-Cover must run in time >= 2^n^c d, for some constant 0<d<1. We study the questions along this line. First, we show that under ETH and PGC any ((1-d) n)-approximation for Set-Cover requires 2^n^d-time. This (almost) matches the running time of 2^O(n^d) for approximating Set-Cover to a factor (1-d) ln n by Cygan et al. [IPL, 2009]. Our result is tight up to the constant multiplying the n^d terms in the exponent. This lower bound applies to all of its generalizations, e.g., Group Steiner Tree (GST), Directed Steiner (DST), Covering Steiner Tree (CST), Connected Polymatroid (CP). We also show that in almost exponential time, these problems reduce to Set-Cover: We show (1-d)ln n approximation algorithms for all these problems that run in time 2^n^d n poly(m). We also study log^2-dn approximation for GST. Chekuri-Pal [FOCS, 2005] showed that GST admits (log^2-dn)-approximation in time exp(2^log^d+o(1)n), for any 0 < d < 1. We show the lower bound of GST: any (log^2-dn)-approximation for GST must run in time >= exp((1+o(1))log^d-cn), for any c>0, unless the ETH is false. Our result follows by analyzing the work of Halperin and Krauthgamer [STOC, 2003]. The same lower and upper bounds hold for CST.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

The traditional study of approximation algorithms concerns designing algorithms that run in polynomial time while producing a solution whose cost is within a factor away from the optimal solution. Once the approximation guarantees meet the barrier, a natural question is to ask whether the approximation ratio can be improved if the algorithms are given running time beyond polynomial. This has been a recent trend in designing approximation algorithms that allows ones to break through the hardness barrier; see, e.g., [1, 5, 22, 6, 6, 7, 7, 15, 14].

While ones ask for improving the approximation ratio, another interesting question is to ask the converse: Suppose the approximation ratio has been specified at the start, what is the smallest running time required to achieve such approximation ratio? This question has recently been an active subject of study; see, e.g., [9, 3, 4].

To answer the above question, ones need complexity assumptions stronger than as this standard assumption does not precisely specify the running times besides polynomial versus super-polynomial. The most popular and widely believed assumption is the Exponential-Time Hypothesis (ETH), which states that 3-SAT admits no -time algorithm. This together with the almost linear size PCP theorems [16, 33] yields many running time lower bounds for approximation algorithms [9, 3, 4]. Let us give an example of the results of this type:

Example: Consider the Maximum Clique problem, in which the goal is to find a clique of maximum size in a graph on vertices. This problem is known to admit no -approximation, for any , unless [26, 35]. Now, let us ask for an -approximation algorithm, for ranging from constant to . There is a trivial -time approximation algorithm, which is obtained by partitioning vertices of into to parts and finding a maximum clique from each part separately. Clearly, the maximum clique amongst these solutions is an -approximate solution, and the running time is . The question is whether this is the best possible running-time. Chalermsook et al. [9] showed that such a trivial algorithm is almost tight111 Recently, Bansal et al. [1] showed that Maximum Clique admits -approximation in time .. To be precise, under the ETH, there is no -approximation algorithm that runs in time , for any constant , unless the ETH is false.

In this paper, we consider the question along this line. We wish to show the tight lower and upper bounds on the running times of polylogarithmic approximation algorithms for Set-Cover, Group-Steiner-Tree and Directed-Steiner-Tree (which we will define in the next section) and related problems.

  • For any constant , what is the best possible running times for -approximation algorithms for Set-Cover and Directed-Steiner-Tree.

  • For any constant , what is the best possible running time for -approximation algorithms for Group-Steiner-Tree.

In fact, one of our ultimate goals is to find an evidence on which ranges of running-times that the Directed-Steiner-Tree problem admits poly-logarithmic approximations. To be precise, we would like to partially answer the question of whether Directed-Steiner-Tree admits polylogarithmic approximations in polynomial-time, which is a big open problem in the area. While we are far from solving the above question, we aim to prove possibly tight running-time for Directed-Steiner-Tree in the logarithmic range in a very fine-grained manner, albeit assuming two strong assumptions, the Exponential-Time Hypothesis (ETH) [27, 28] and the Projection Game Conjectures (PGC) [32], simultaneously.

1.1 The problems studied in this paper

1.1.1 The Set-Cover problem and its extensions

In the weighted Set-Cover problem, the input is a universe of size and a collection of subsets of . Each set has a cost . The goal is to select a minimum cost subcollection such that the union of the sets in spans the entire universe .

The more general Submodular-Cover problem admits as input a universe with cost on every . A function is submodular if for every and for every , . Let be a submodular non-decreasing function. The goal in the submodular cover problem is to minimize subject to . This problem strictly generalizes the weighted Set-Cover problem.

The Connected-Polymatroid problem is the case that the elements in are leaves of a tree, and both the elements and tree edges have costs. The goal is to select a set so that and that is minimized, where is the unique tree rooted at spanning .

1.1.2 The Group-Steiner-Tree problem

In the Group-Steiner-Tree problem, the input consists an undirected graph with cost on each edge , a collection of subsets (called group) and a special vertex . The goal is is to find a minimum cost tree rooted at that contains at least one vertex from every group . In the Covering-Steiner-Tree problem, there is a demand for every and vertices of must be spanned in the tree rooted by This Group-Steiner-Tree problem strictly contains the Set-Cover problem. Every result for Group-Steiner-Tree holds also for the Covering-Steiner-Tree problem given that there is a reduction from Covering-Steiner-Tree to Group-Steiner-Tree [19, 24].

1.1.3 The Directed-Steiner-Tree problem

In the Directed-Steiner-Tree problem, the input consists of a directed graph with costs on edges, a collection of terminals, and a designated root . The goal is to find a minimum cost directed graph rooted at that spans . This problem has Group-Steiner-Tree as a special case.

1.2 Related work

The Set-Cover problem is a well-studied problem. The first logarithmic approximation, to the best of our knowledge, is traced back to the early work of Johnson [29]. Many different approaches have been proposed to approximate Set-Cover, e.g., the dual-fitting algorithm by Chvátal [13]; however, all algorithms yield roughly the same approximation ratio. The more general problem, namely, the Submodular-Cover problem was also shown to admit -approximation in the work of Wolsey [34]. The question of why all these algorithms yield the same approximation ratio was answered by Lund and Yannakakis [31] who showed that the approximation ratio is essentially the best possible unless . Subsequently, Feige [21] showed the more precise lower bound that Set-Cover admits no -approximation, for any , unless ; this assumption has been weaken to by the recent work of Dinur and Steurer [17]. These lower bounds are, however, restricted to polynomial-time algorithms. In the regime of subexponential-time, Cygan, Kowalik and Wykurz [15] showed that Set-Cover admits an approximation ratio of in time. On the negative side, Moshkovitz [32] introduced the Projection Games Conjecture (PGC) to prove the approximation hardness of Set-Cover. Originally, the conjecture was introduced in an attempt to show the -hardness of Set-Cover under (which is now proved by Dinur and Steurer [17]). It turns out that this implicitly implies that Set-Cover admits no -approximation algorithm in time under PGC and ETH.

The generalization of the Set-Cover problem is the Group-Steiner-Tree problem. Garg, Konjevod and Ravi [23] presented a novel LP rounding algorithm to approximate Group-Steiner-Tree on trees to within a factor of . Using the probabilistic metric-tree embedding [2, 20], this implies an -approximation algorithm for Group-Steiner-Tree in general graphs. On the negative side, Halperin and Krauthgamer showed the lower bound of for any for approximating Group-Steiner-Tree on trees under the assumption that . This (almost) matches the upper bound given by the algorithm by Garg et al. For the related problem, the Connected Polymatroid problem was given a polylogarithmic approximation algorithm by Cálinescu and Zelikovsky [8]; their algorithm is based on the work of Chekuri, Even and Kortsarz [11], which gave a combinatorial approximation for Group-Steiner-Tree on trees.

The problem that generalizes all the above problems is the Directed-Steiner-Tree problem. The best known approximation ratio for this problem is for any constant [10, 30] in polynomial-time. In quasi-polynomial-time, Directed-Steiner-Tree admits an -approximation algorithm. The question of whether Directed-Steiner-Tree admits a polylogarithmic approximation in polynomial-time has been a long standing open problem.

2 Our results

We show that under the combination of ETH and PGC, the running time for approximating Set-Cover to within a factor of must be at least , where is a given parameter. This improves the work of Moshkovitz who (implicitly) showed the running time lower bound of . We complement this by showing that Directed-Steiner-Tree admits a approximation algorithm that runs in time time. Since Directed-Steiner-Tree is the generalization of Set-Cover, Group-Steiner-Tree and Directed-Steiner-Tree, the lower bounds apply to all the aforementioned problems. Hence, up to a small factor of in the exponent, we get tight running time lower bounds for approximating all these problems to within . Essentially, the same algorithm and proof give the same result for the Connected-Polymatroid problem.

We also investigate the work of Chekuri and Pal [12] who showed that, for any constant , Group-Steiner-Tree admits a approximation algorithm that runs in time . We show that, for any constant , there is no approximation algorithm for Group-Steiner-Tree (and thus Covering-Steiner-Tree) that runs in time . This lower bound is nearly tight. We note that a reduction from Covering-Steiner-Tree to Group-Steiner-Tree was given in [19]. Thus, any approximation algorithm for Group-Steiner-Tree also applies for Covering-Steiner-Tree.

3 Formal definition of our two complexity assumptions

Definition 3.1.

In the Label-Cover problem with the projection property (a.k.a., the Projection game), we are given a bipartite graph , two alphabet sets (also called labels) and , and for any edge (also called query) , there is a function . A labeling is a pair of functions and assigning labels to each vertices of and , respectively. An edge is covered by if . The goal in Label-Cover is to find a labeling that covers as many edges as possible.

In the context of the Two-Provers One-Round game (2P1R), every label is an answer to some ”question” sent to the Player and some question sent to the Player , for a query . The two answers make the verifier accept if a label assigned to and a label assigned to satisfy . Since any label has a unique label in that causes the verifier to accept, is called the projection of into .

We use two conjectures in our paper. The first is the Exponential Time Hypothesis (ETH), which asserts that an instance of the 3-SAT problem on variables and clauses cannot be solved in -time. This was later showed by Impagliazzo, Paturi and Zane [27] that any 3-SAT instance can be sparsified in -time to an instance with clauses. Thus, ETH together with the sparsification lemma [28] implies the following:

Exponential-Time Hypothesis combined with the Sparsification Lemma: Given a boolean 3-CNF formula on variables and clauses, there is no -time algorithm that decides whether is satisfiable. In particular, 3-SAT admits no subexponential-time algorithm.

The following was proven by Moshkovitz and Raz [33].

Theorem 3.2 ([33]).

There exists , such that for every , -SAT on inputs of size can be efficiently reduced to Label-Cover of size over an alphabet of size that has soundness error . The graph is bi-regular (namely, every two questions on the same side participate in the same number of queries).

There does not seem to be an inherent reason that the alphabet would be so large. This leads to the following conjecture posed by Moshkovitz [32].

Conjecture 3.3 (The Projection Games Conjecture [32]).

There exists , such that for every , -SAT on inputs of size can be efficiently reduced to Label-Cover of size over an alphabet of size that has soundness error . Moreover, the graph is bi-regular (namely, every two questions on the same side participate in the same number of queries).

The difference between Theorem 3.2 and Conjecture 3.3 is in the size of the alphabet.

For our purposes, we only need soundness , and we know that the degree and alphabet size of the graph in Conjecture 3.3 are always (which are inverse of the soundness). Hence, we may assume the (slightly) weaker assumption (obtained by setting in Conjecture 3.3) as below.

Conjecture 3.4 (Projection Games Conjecture, a variant).

There exists , such that for every , -SAT on inputs of size can be efficiently reduced to Label-Cover of size where the graph is bi-regular and all degrees are bounded by . The size of the alphabet is and the soundness is . and the completeness is .

We need to inspect very carefully and slightly change the proof of [32] since we do not want the Label-Cover instance to grow by a lot by the modification in [32]. Hence, in fact we have to go over all steps of [32] and bound the size more carefully in all steps that require that.

4 First part of the proof

We start with the same definition as in [32].

Definition 4.1 (Total disagreement).

Let be a Label-Cover instance. Let be an assignment to the A-vertices. We say that the A-vertices totally disagree on a vertex , if there are no two neighbors of , for which

where .

The above simply states that for a given assignment and a vertex , no matter which label we assign to the vertex , we will satisfy only one edge incident to it.

Definition 4.2 (Agreement soundness).

Let be a Label-Cover for deciding whether a Boolean formula is satisfiable. We say that has agreement soundness error , if for unsatisfiable , for any assignment , the -vertices are in total disagreement on at least fraction of the .

For a Yes-Instance (of 3-SAT), a standard argument implies that you can label the vertices so that every edge is covered. The usual condition of soundness required is that the number of edges covered is a small fraction of the edges, for every label assignment. The total disagreement is stronger than that. It states that for any assignment , no matter how we set almost all of vertices of will have at most one incident edge satisfied.

In the rest of this subsection the goal is to show (list) agreement soundness error of bounded degree Label-Cover instances. First, we use the following lemma (we do not alter its proof).

Lemma 4.3 (Combinatorial construction).

For , for a prime power , and that is a power of , there is an explicit construction of a regular bipartite graph with , -degree , and that satisfies the following. For every partition of into sets such that , for , the fraction of vertices with more than one neighbor in any single set , is at most .

It is rather trivial to show the above lemma by a probabilistic method. Moshkovitz showed in [32] that such graphs can be constructed deterministically via a simple and elegant construction.

In the next lemma, we show how to take a Label-Cover instance with standard soundness and convert it to a Label-Cover instance with total disagreement soundness, by combining it with the graph from Lemma 4.3. Here (as opposed to [32]) we have to bound the size of the created instance more carefully ([32] only states that the size is raised to a constant power).

Lemma 4.4.

Let be a prime power and let be a power of . Let . From a Label-Cover instance with soundness error and -degree , we can construct a Label-Cover instance with agreement soundness error and -degree . The transformation preserves the alphabets, and the size of the created instance is increased by a factor , namely by polynomial in the original -degree.


Let be the original Label-Cover from the Projection Game Conjecture. Let be the graph from Lemma 4.3, where , and are as given in the current lemma. Let us use to enumerate the neighbors of a -vertex, i.e., there is a function that, given a vertex and , gives us the -vertex which is the neighbor of .

We create a new Label-Cover . The intended assignment to every vertex is the same as its assignment in the original instance. The intended assignment to a vertex is the same as the assignment to in the original game. We put an edge if there exist such that and . We define .

If there is an assignment to the original instance that satisfies fraction of its edges, then the corresponding assignment to the new instance satisfies fraction of its edges (this follows from the regularity of the graph ).

Suppose there is an assignment for the new instance in which more than fraction of the vertices in do not have total disagreement.

Let us say that is good if for more than an fraction of the vertices in the -vertices do not totally disagree. Note that the fraction of good is at least .

Focus on a good . Consider the partition of into sets, where the set corresponding to is:

By the goodness of and the property of , there must be such that . We call the “champion” for .

We define an assignment that assigns good vertices their champions, and other vertices arbitrary values. The fraction of edges that satisfy in the original instance is at least .

The new instance is bigger by a factor , which is . ∎

Next we consider a variant of Label-Cover that is relevant for the reduction to Set-Cover. In this variant, the prover is allowed to assign each vertex values, and an agreement is interpreted as agreement on one of the assignments in the list.

Definition 4.5 (List total disagreement [32]).

Let be a Label-Cover. Let . Let be an assignment that assigns each -vertex alphabet symbols. We say that the -vertices totally disagree on a vertex if there are no two neighbors of b, for which there exist such that

where .

Definition 4.6 (List agreement soundness [32]).

Let be a Label-Cover for deciding membership whether a Boolean formula is satisfiable. We say that has list-agreement soundness error , if for unsatisfiable , for any assignment , the A-vertices are in total disagreement on at least fraction of the .

If a PCP has low error , then even when the prover is allowed to assign each -vertex values, the game is still sound. This is argued in the next corollary.

Lemma 4.7 (Lemma 4.7 of [32]).

Let , . Any instance of Label-Cover with agreement soundness error has list-agreement soundness error .

The following corollary summarizes this subsection.

Corollary 4.8.

For any , for any constant prime power and constant , 3-SAT on input of size can be reduced to a Label-Cover instance of size with alphabet size , where the -degree is , and the list-agreement soundness error is .


Our starting point is the Label-Cover instance from 3.4 with soundness error , such that . Note that the -degree of the instance is . The corollary then follows by invoking Lemma 4.4 and Lemma 4.7. ∎

4.1 From Label-Cover to Set-Cover

Lemma 4.9 (Partition System [32]).

For natural numbers , , and , for all , there is an explicit construction of a universe of size and partitions of into sets that satisfy the following: there is no cover of with sets , , such that each set belongs to the partition .

We will use the contrapositive of the lemma: if U has a cover of size at most , then this cover must contain at least two sets from the same partition. Next follows the reduction, which is almost the same as in [32], where the only difference is the parameter setting.

We take a Label-Cover instance from Corollary 4.8 and transform it into an instance of Set-Cover. In order to do so, we invoke Lemma 4.9 with and which is the -degree of . The parameter will be determined later. Let be the universe, and be the partitions of , where the partitions are indexed by symbols of . The elements of the Set-Cover instance are , i.e., for each vertex there is a copy of . Covering corresponds to satisfying the edges that touch . There are ways to satisfy the edges that touch – one for every possible assignment to . The different partitions covering correspond to those different assignments.

For every vertex and an assignment to , we have a set in the Set-Cover instance. Taking to the cover would correspond to assigning to . Notice that a cover might consist of several sets of the form for the same , which is the reason we consider list agreement. The set is a union of subsets, one for every edge touching . Suppose is the -th edge coming into (), then the subset associated with is , where is the -th subset of the partition .

If we have an assignment to the -vertices such that all of the neighbors of agree on one value for , then the subsets corresponding to those neighbors and their assignments form a partition that covers ’s universe. On the other hand, if one uses only sets that correspond to totally disagreeing assignments to the neighbors, then by the definition of the partitions, covering requires times more sets. The formal claim proved by Moshkovitz is as follows.

Claim 4.10 (Claim 4.10 of [32]).

The following holds

  • Completeness: If all the edges in can be satisfied, then the created instance admits a set cover of size .

  • Soundness: Let be as in Lemma 4.9. If has agreement soundness , then every set cover of the created instance is of size more than .

The following is our main theorem, where we fine-tune the parameters to get the best possible (and thus almost tight) running time lower bound.

Theorem 4.11.

Fix a constant and . Assuming PGC there is an algorithm that given an instance of -SAT of size one can create an instance of Set-Cover with universe of size such that if is satisfiable, then has a set cover of size , while if is not satisfiable, then does not admit a set cover of size at most .


Given a sparsified 3-CNF formula of size we transform it into a Label-Cover instance , by Corollary 4.8, obtaining a list-agreement soundness error , where we set and . Next, we perform the reduction from this section and by Claim 4.10 we have the following:

  • If is satisfiable, then there exists a solution of size (where is one side of ).

  • If is not satisfiable, then any set cover has size more than .

By setting the value of appropriately we get a tradeoff between the approximation ratio and running time in the following lower bound obtained directly from Theorem 4.11.

Corollary 4.12.

Unless the ETH fails, for any and there is no approximation for Set-Cover with universe of size and sets in time .


Set , then the created instance has at most elements, which fits the desired running time in the lower bound. It remains to analyze the approximation ratio. Note that , hence

5 Approximating Directed Steiner Tree

In this section, we present a -approximation algorithm for Directed-Steiner-Tree running in time .

Lemma 5.1.

For any rooted tree with leaves, there exists a set of vertices together with a family of edge disjoint trees , such that:

  • the trees are edge (but not vertex) disjoint

  • each is a subtree of ,

  • the root of each belongs to ,

  • each leaf of is a leaf of exactly one ,

  • each has more than but less than leaves.


As long as the tree has more than leaves do the following: pick the lowest vertex in the tree, the subtree rooted at which has more than leaves. This implies that all its children contain strictly less than leaves. Accumulation subtrees gives at most leaves since before the last iteration there were less that leaves, and the last iteration adds a tree of at most leaves. Remove the collected tree, but do not remove their root (namely this root may later participate in other trees). Note that after the accumulated trees are removed, the tree rooted by our chosen root may still have more than leaves. This gives edge disjoint trees with leaves each. Thus, there is a tree with leaves, and density (cost over the number of leaves) no larger than the optimum density. ∎

For simplicity, we make sure that the number of leaves in each tree is exactly by discarding leaves. Since the trees are edge disjoint there must be a tree whose density: cost over the number of leaves is not worse (up to a factor of ) than the optimum density .

Let be an instance of Directed-Steiner-Tree. Our algorithm enumerates guesses the (roughly) leaves in the tree whose density is no worse than the optimal density, and also guesses the subset that behaves as Steiner vertices. Assuming the graph went via a transitive closure, the size of is at most the size of of size . For a fixed set , the algorithm first finds an optimum directed Steiner tree . We note that assuming that the graph went via transitive closure, we may assume that the number of Steiner vertices is less than the number of leaves, and so we may guess the Steiner vertices at time as well. It is known that given the Steiner vertices and the leaves of the tree, we can, in polynomial time, find the best density tree with these leaves and these vertices. The first such algorithm is due to Dreyfus and Wagner [18]. The algorithm is quite non trivial and that uses dynamic programming. The running time of the algorithm is time which is negligible in our context.

We iterate adding more trees in this way. Each time we find the best density tree rooted at some vertex of which covers leaves, and add the edges to . Each time it requires time. Finally, when there are less than unconnected terminals left, we find an optimum directed Steiner tree for those vertices.

Lemma 5.2.

The approximation ratio of the above algorithm is at most .


Let be an optimum Steiner tree spanning , let opt be its cost and let be the set from Lemma 5.1 for the tree . Let us analyze the algorithm in the iteration when it chooses the set properly, that is picks the same set as Lemma 5.1. Note that since vertices of belong to the cost of the first tree found by the algorithm is at most opt. The last property of Lemma 5.1 guarantees, that our algorithm always finds a tree with at least as good density as , where is the number of not yet connected terminals. By the standard set-cover type analysis we can bound the cost of all the best density trees found by the algorithm by

Finally, the last tree is of cost at most opt, and it can be found in time . ∎

Now we observe that the same theorem applies for the Connected-Polymatroid problem. Since the function is both submodular and increasing for every collection of pairwise disjoint sets , . Thus for a given , at iteration there exists a collection of leaves so that . We can guess in time and its set of Steiner vertices in time . Using the algorithm of [18], we can find a tree of density at most . The rest of the proof is identical.

6 Hardness for Group Steiner Tree under the Eth

In this section, we show that the approximation hardness of the group Steiner problem under the ETH, which implies that the subexponential-time algorithm for Group-Steiner-Tree of Chekuri and Pal [12] is nearly tight. This hardness result is implicitly in the work Halperin and Krauthgamer [25]. More precisely, the following is a corollary of Theorem 1.1 in [25].

Theorem 6.1 (Corollary of Theorem 1.1 in [25]).

Unless the ETH is false, for any parameter , there is no -time -approximation algorithm for Group-Steiner-Tree, for any .

Proof Sketch of Theorem 6.1.

We provide here the parameter translation of the reduction in [25], which will prove Theorem 6.1.

The Reduction of Halperin and Krauthgamer.

We shall briefly describe the reduction of Halperin and Krauthgamer. The starting point of their reduction is the Label-Cover instance obtained from rounds of parallel repetition. In the first step, given a -regular Label-Cover instance completeness and soundness , they apply rounds of parallel repetition to get a -regular instance of Label-Cover . To simplify the notation, we let , be the number of vertices and the alphabet size of the Label-Cover instance , respectively. Then we have that the number of vertices and the alphabet size of is and , respectively. In the second step, they apply a recursive composition to produce an instance of Group-Steiner-Tree on a complete -ary tree of height on groups. Moreover, if is a Yes-Instance (i.e., there is a labeling that covers all the constraints), then there is a feasible solution to Group-Steiner-Tree with cost

with high probability, and if

is a No-Instance (i.e., every labeing covers at most fraction of the edges), then there is no solution with cost less than , for some sufficiently small constant .

In short, the above reduction gives an instance of Group-Steiner-Tree on a tree with vertices, groups, and with approximation hardness gap . Additionally, the reduction in [25] requires for some sufficiently large constant . ∎

Subexponential-Time Approximation-Hardness.

Now we derive the subexponential-time approximation hardness for Group-Steiner-Tree. We start by the nearly linear-size PCP theorem of Dinur [16], which gives a reduction from 3-SAT of size (the number of variables plus the number of clauses) to a label cover instance with completeness , soundness for some , , degree and alphabet sets .

For every parameter , we choose , which then forces us to choose . Note that we may assume that since it is a fixed parameter. Plugging in these parameter settings, we have an instance of Group-Steiner-Tree on a tree with vertices and groups such that


Observe that . Thus, the hardness gap is . This means that any algorithm for Group-Steiner-Tree on this family of instances with approximation ratio , for any constant , would be able to solve 3-SAT.

Now suppose there is an -time -approximation algorithm for Group-Steiner-Tree, for some . We apply such algorithm to solve an instance of Group-Steiner-Tree derived from 3-SAT as above. Then we have an algorithm that runs in time

This implies a subexponential-time algorithm for 3-SAT, which contradicts the ETH. Therefore, unless the ETH is false, there is no -time -approximation algorithm for Group-Steiner-Tree, thus proving Theorem 6.1

Since we take log from the expression, the above is also true if we replace by . Combined with [12] and [19], we have the following corollary which shows almost tight running-time lower and upper bounds for approximating Group-Steiner-Tree and Covering-Steiner-Tree to a factor .

Corollary 6.2.

The Group-Steiner-Tree and Covering-Steiner-Tree problems on graphs with vertices admit -approximation algorithms for any constant that runs in time . In addition, for any constant there is no approximation algorithm for Group-Steiner-Tree and Covering-Steiner-Tree that runs in time .

Remark: We omit the algorithm for the Connected-Polymatroid problem, as its similar to the algorithm for Directed-Steiner-Tree. The lower bound holds because Connected-Polymatroid has Set-Cover as a special case.


The work of Marek Cygan is part of a project TOTAL that has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 677651). Guy Kortsarz was partially supported by NSF grant 1540547. Bundit Laekhanukit was partially supported by ISF grant no. 621/12, and I-CORE grant no. 4/11 and by the 1000-youth award from the Chinese Government. Parts of the work were done while Guy Kortsarz and Bundit Laekhanukit were at the Weizmann Institute of Science, and parts of it were done while Bundit Laekhanukit was at the Max-Plank-Institute for Informatics.


  • [1] N. Bansal, P. Chalermsook, B. Laekhanukit, D. Nanongkai, and J. Nederlof. New tools and connections for exponential-time approximation. CoRR, abs/1708.03515, 2017.
  • [2] Y. Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. In 37th Annual Symposium on Foundations of Computer Science, FOCS ’96, Burlington, Vermont, USA, 14-16 October, 1996, pages 184–193, 1996.
  • [3] E. Bonnet, B. Escoffier, E. J. Kim, and V. T. Paschos. On subexponential and fpt-time inapproximability. Algorithmica, 71(3):541–565, 2015. Preliminary version in IPEC’13.
  • [4] É. Bonnet, M. Lampis, and V. T. Paschos. Time-approximation trade-offs for inapproximable problems. J. Comput. Syst. Sci., 92:171–180, 2018.
  • [5] É. Bonnet and V. T. Paschos. Sparsification and subexponential approximation. Acta Inf., 55(1):1–15, 2018.
  • [6] N. Bourgeois, B. Escoffier, and V. T. Paschos. Efficient approximation of min set cover by moderately exponential algorithms. Theor. Comput. Sci., 410(21-23):2184–2195, 2009.
  • [7] N. Bourgeois, B. Escoffier, and V. T. Paschos. Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discrete Applied Mathematics, 159(17):1954–1970, 2011.
  • [8] G. Călinescu and A. Zelikovsky. The polymatroid steiner problems. J. Comb. Optim., 9(3):281–294, 2005. Preliminary version in ISAAC’04.
  • [9] P. Chalermsook, B. Laekhanukit, and D. Nanongkai. Independent set, induced matching, and pricing: Connections and tight (subexponential time) approximation hardnesses. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pages 370–379, 2013.
  • [10] M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li. Approximation algorithms for directed steiner problems. J. Algorithms, 33(1):73–91, 1999. Preliminary version in SODA’98.
  • [11] C. Chekuri, G. Even, and G. Kortsarz. A greedy approximation algorithm for the group steiner problem. Discrete Applied Mathematics, 154(1):15–34, 2006.
  • [12] C. Chekuri and M. Pál. A recursive greedy algorithm for walks in directed graphs. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings, pages 245–253, 2005.
  • [13] V. Chvátal.

    A greedy heuristic for the set-covering problem.

    Math. Oper. Res., 4(3):233–235, 1979.
  • [14] M. Cygan, L. Kowalik, M. Pilipczuk, and M. Wykurz. Exponential-time approximation of hard problems. CoRR, abs/0810.4934, 2008.
  • [15] M. Cygan, L. Kowalik, and M. Wykurz. Exponential-time approximation of weighted set cover. Inf. Process. Lett., 109(16):957–961, 2009.
  • [16] I. Dinur. The PCP theorem by gap amplification. J. ACM, 54(3):12, 2007. Preliminary version in STOC’06.
  • [17] I. Dinur and D. Steurer. Analytical approach to parallel repetition. In Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014, pages 624–633, 2014.
  • [18] S. E. Dreyfus and R. A. Wagner. The Steiner problem in graphs. Networks, 1(3):195–207, 1971.
  • [19] G. Even, G. Kortsarz, and W. Slany. On network design problems: Fixed cost flows and the covering steiner problem. In Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pages 318–327, 2002.
  • [20] J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci., 69(3):485–497, 2004. Preliminary version in STOC’03.
  • [21] U. Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4):634–652, 1998. Preliminary in STOC’96.
  • [22] D. Fotakis, M. Lampis, and V. T. Paschos. Sub-exponential approximation schemes for csps: From dense to almost sparse. In 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, pages 37:1–37:14, 2016.
  • [23] N. Garg, G. Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group steiner tree problem. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 25-27 January 1998, San Francisco, California., pages 253–259, 1998.
  • [24] A. Gupta and A. Srinivasan. On the covering steiner problem. In FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings, pages 244–251, 2003.
  • [25] E. Halperin and R. Krauthgamer. Polylogarithmic inapproximability. In STOC, pages 585–594, 2003.
  • [26] J. Håstad. Clique is hard to approximate within n. In 37th Annual Symposium on Foundations of Computer Science, FOCS ’96, Burlington, Vermont, USA, 14-16 October, 1996, pages 627–636, 1996.
  • [27] R. Impagliazzo and R. Paturi. On the complexity of k-sat. J. Comput. Syst. Sci., 62(2):367–375, 2001. Preliminary version in CCC’99.
  • [28] R. Impagliazzo, R. Paturi, and F. Zane. Which problems have strongly exponential complexity? J. Comput. Syst. Sci., 63(4):512–530, 2001. Preliminary version in FOCS’98.
  • [29] D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci., 9(3):256–278, 1974. Preliminary version in STOC’73.
  • [30] G. Kortsarz and D. Peleg. Approximating the weight of shallow steiner trees. Discrete Applied Mathematics, 93(2-3):265–285, 1999. Preliminary version in SODA’97.
  • [31] C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. J. ACM, 41(5):960–981, 1994.
  • [32] D. Moshkovitz. The projection games conjecture and the np-hardness of ln n-approximating set-cover. Theory of Computing, 11:221–235, 2015. Preliminary version in APPROX’12.
  • [33] D. Moshkovitz and R. Raz. Two-query PCP with subconstant error. J. ACM, 57(5):29:1–29:29, 2010. Preliminary version in FOCS’08.
  • [34] L. A. Wolsey. An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica, 2(4):385–393, 1982.
  • [35] D. Zuckerman. Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing, 3(1):103–128, 2007. Preliminary version in STOC’06.