14 research outputs found
Approximability of Capacitated Network Design
In the capacitated survivable network design problem (Cap- SNDP), we are given an undirected multi-graph where each edge has a capacity and a cost. The goal is to find a minimum cost subset of edges that satisfies a given set of pairwise minimum-cut requirements. Unlike its classical special case of SNDP when all capacities are unit, the approximability of Cap-SNDP is not well understood; even in very restricted settings no known algorithm achieves a o(m) approximation, where m is the number of edges in the graph. In this paper, we obtain several new results and insights into the approximability of Cap-SNDP. We give an O(log n) approximation for a special case of Cap-SNDP where the global minimum cut is required to be at least R, by rounding the natural cut-based LP relaxation strengthened with valid knapsackcover inequalities. We then show that as we move away from global connectivity, the single pair case (that is, when only one pair (s, t) has positive connectivity requirement) captures much of the difficulty of Cap-SNDP: even strengthened with KC inequalities, the LP has an âŠ(n) integrality gap. Furthermore, in directed graphs, we show that single pair Cap-SNDP is 2log1â3 n-hard to approximate for any fixed constant ÎŽ \u3e 0. We also consider a variant of the Cap-SNDP in which multiple copies of an edge can be bought: we give an O(log k) approximation for this case, where k is the number of vertex pairs with non-zero connectivity requirement. This improves upon the previously known O(min{k, log Rmax})-approximation for this problem when the largest minimumcut requirement, namely Rmax, is large. On the other hand, we observe that the multiple copy version of Cap-SNDP is âŠ(log log n)-hard to approximate even for the single-source version of the problem
Approximating Source Location and Star Survivable Network Problems
Abstract. In Source Location (SL) problems the goal is to select a minimum cost source set S â V such that the connectivity (or flow) Ï(S, v) from S to any node v is at least the demand dv of v. In many SL problems Ï(S, v) = dv if v â S, namely, the demand of nodes se-lected to S is completely satisfied. In a node-connectivity variant sug-gested recently by Fukunaga [6], every node v gets a âbonus â pv †dv if it is selected to S, namely, Ï(S, v) = pv + Îș(S \ {v}, v) if v â S and Ï(S, v) = Îș(S, v) otherwise, where Îș(S, v) is the maximum number of internally disjoint (S, v)-paths. While the approximability of many SL problems was seemingly settled to Î(ln d(V)) in [18], Fukunaga [6] showed that for undirected graphs one can achieve ratio O(k ln k) for his variant, where k = maxvâV dv is the maximum demand. We improve this by achieving ratio min{p â ln k, k} · O(ln(k/qâ)) for a more general version with node capacities, where p â = maxvâV pv is the maximum bonus and q â = minvâV qv is the minimum capacity. In particular, for the most natural case p â = 1 considered in [6] we improve the ratio from O(k ln k) to O(ln2 k). Our result also implies ratio k for the edge-connectivity version. To derive these results, we consider a particular case of the Survivable Network (SN) problem when all edges of positive cost form a star. We give ratio O(min{lnn, ln2 k}) for this variant, improving over the best ratio known for the general case O(k3 lnn) of Chuzhoy and Khanna [3]. In addition, we show that directed SL with unit costs is âŠ(logn)-hard to approximate even for 0, 1 demands, while SL with uniform demands can be solved in polynomial time. Finally, we consider a generalization of SL where we also have edge-costs {ce: e â E} and flow-cost bounds {bv: v â V}, and require that for every node v, the minimum cost of a flow of value dv from S to v is at most bv. We show that this problem admits approximation ratio O(ln d(V) + ln(nc(E) â b(V)).
Approximating node-connectivity augmentation problems
We consider the (undirected) Node Connectivity Augmentation (NCA) problem: given a graph J = (V,EJ) and connectivity requirements {r(u,v) : u,v â V}, find a minimum size set I of new edges (any edge is allowed) such that the graph J âȘ I contains r(u,v) internally-disjoint uv-paths, for all u,v â V. In Rooted NCA there is s â V such that r(u,v)> 0 implies u = s or v = s. For large values of k = max r(u,v), NCA is at least as hard to approximate as Label-Cover and thus it is u,vâV unlikely to admit an approximation ratio polylogarithmic in k. Rooted NCA is at least as hard to approximate as Hitting-Set. The previously best approximation ratios for the problem were O(klnn) for NCA and O(lnn) for Rooted NCA. In this paper we give an approximation algorithm with ratios O(kln 2 k) for NCA and O(ln 2 k) for Rooted NCA. This is the first approximation algorithm with ratio independent of n, and thus is a constant for any fixed k. Our algorithm is based on the following new structural result which is of independent interest. If D is a set of node pairs in a graph J, then the maximum degree in the hypergraph formed by the inclusion minimal tight sets separating at least one pair in D is O(â 2), where â is the maximum connectivity in J of a pair in D. A preliminary version of this paper is [29]