5 research outputs found

    A Better Approximation Ratio for the Minimum Size k-Edge-Connected Spanning Subgraph Problem

    No full text
    Consider the minimum size k-edge-connected spanning subgraph problem: given a positive integer k and a k-edge-connected graph G, nd a k-edge-connected spanning subgraph of G with the minimum number of edges. This problem is known to be NP-complete. Khuller and Raghavachari presented the rst algorithm which, for all k, achieves a performance ratio smaller than a constant which is less than two. They proved an upper bound of 1.85 for the performance ratio of their algorithm. Currently, the best known performance ratio for the problem is 1+2=(k+ 1), achieved by a slower algorithm of Cheriyan and Thurimella. In this paper, we improve Khuller and Raghavachari's analysis, proving that the performance ratio of their algorithm is smaller than 1.7 for large enough k, and that it is at most 1.75 for all k. Second, we show that the minimum size 2-edge-connected spanning subgraph problem is MAX SNP-hard. A preliminary version of this paper appeared in the Proceedings of the 8 th Annual ACM..

    Approximating Minimum-Size 2-Edge-Connected and 2-Vertex-Connected Spanning Subgraphs

    Get PDF
    We study the unweighted 2-edge-connected and 2-vertex-connected spanning subgraph problems. A graph is 2-edge-connected if it is connected on removal of an edge, and it is 2-vertex-connected if it is connected on removal of a vertex. The problem of finding a minimum-size 2-edge-connected (or 2-vertex-connected) spanning subgraph of a given graph is NP-hard. We present a 4/3-approximation algorithm for unweighted 2ECSS on 3-vertex-connected input graphs, which matches the best known approximation ratio due to Sebő and Vygen for the general unweighted 2ECSS problem, but our analysis is with respect to the D2 lower bound. We also give a 17/12-approximation algorithm for unweighted 2VCSS on graphs of minimum degree at least 3, which is lower than the best known ratios of 3/2 by Garg, Santosh and Singla and 10/7 by Heeger and Vygen for the general unweighted 2VCSS problem. These algorithms are accompanied by new theorems about the known lower bounds

    Approximation Algorithms for (S,T)-Connectivity Problems

    Get PDF
    We study a directed network design problem called the kk-(S,T)(S,T)-connectivity problem; we design and analyze approximation algorithms and give hardness results. For each positive integer kk, the minimum cost kk-vertex connected spanning subgraph problem is a special case of the kk-(S,T)(S,T)-connectivity problem. We defer precise statements of the problem and of our results to the introduction. For k=1k=1, we call the problem the (S,T)(S,T)-connectivity problem. We study three variants of the problem: the standard (S,T)(S,T)-connectivity problem, the relaxed (S,T)(S,T)-connectivity problem, and the unrestricted (S,T)(S,T)-connectivity problem. We give hardness results for these three variants. We design a 22-approximation algorithm for the standard (S,T)(S,T)-connectivity problem. We design tight approximation algorithms for the relaxed (S,T)(S,T)-connectivity problem and one of its special cases. For any kk, we give an O(logklogn)O(\log k\log n)-approximation algorithm, where nn denotes the number of vertices. The approximation guarantee almost matches the best approximation guarantee known for the minimum cost kk-vertex connected spanning subgraph problem which is O(logklognnk)O(\log k\log\frac{n}{n-k}) due to Nutov in 2009

    Algorithms and complexity analyses for some combinational optimization problems

    Get PDF
    The main focus of this dissertation is on classical combinatorial optimization problems in two important areas: scheduling and network design. In the area of scheduling, the main interest is in problems in the master-slave model. In this model, each machine is either a master machine or a slave machine. Each job is associated with a preprocessing task, a slave task and a postprocessing task that must be executed in this order. Each slave task has a dedicated slave machine. All the preprocessing and postprocessing tasks share a single master machine or the same set of master machines. A job may also have an arbitrary release time before which the preprocessing task is not available to be processed. The main objective in this dissertation is to minimize the total completion time or the makespan. Both the complexity and algorithmic issues of these problems are considered. It is shown that the problem of minimizing the total completion time is strongly NP-hard even under severe constraints. Various efficient algorithms are designed to minimize the total completion time under various scenarios. In the area of network design, the survivable network design problems are studied first. The input for this problem is an undirected graph G = (V, E), a non-negative cost for each edge, and a nonnegative connectivity requirement ruv for every (unordered) pair of vertices &ruv. The goal is to find a minimum-cost subgraph in which each pair of vertices u,v is joined by at least ruv edge (vertex)-disjoint paths. A Polynomial Time Approximation Scheme (PTAS) is designed for the problem when the graph is Euclidean and the connectivity requirement of any point is at most 2. PTASs or Quasi-PTASs are also designed for 2-edge-connectivity problem and biconnectivity problem and their variations in unweighted or weighted planar graphs. Next, the problem of constructing geometric fault-tolerant spanners with low cost and bounded maximum degree is considered. The first result shows that there is a greedy algorithm which constructs fault-tolerant spanners having asymptotically optimal bounds for both the maximum degree and the total cost at the same time. Then an efficient algorithm is developed which finds fault-tolerant spanners with asymptotically optimal bound for the maximum degree and almost optimal bound for the total cost

    Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization

    Get PDF
    We study techniques, approximation algorithms, structural properties and lower bounds related to applications of linear programs in combinatorial optimization. The following "Steiner tree problem" is central: given a graph with a distinguished subset of required vertices, and costs for each edge, find a minimum-cost subgraph that connects the required vertices. We also investigate the areas of network design, multicommodity flows, and packing/covering integer programs. All of these problems are NP-complete so it is natural to seek approximation algorithms with the best provable approximation ratio. Overall, we show some new techniques that enhance the already-substantial corpus of LP-based approximation methods, and we also look for limitations of these techniques. The first half of the thesis deals with linear programming relaxations for the Steiner tree problem. The crux of our work deals with hypergraphic relaxations obtained via the well-known full component decomposition of Steiner trees; explicitly, in this view the fundamental building blocks are not edges, but hyperedges containing two or more required vertices. We introduce a new hypergraphic LP based on partitions. We show the new LP has the same value as several previously-studied hypergraphic ones; when no Steiner nodes are adjacent, we show that the value of the well-known bidirected cut relaxation is also the same. A new partition uncrossing technique is used to demonstrate these equivalences, and to show that extreme points of the new LP are well-structured. We improve the best known integrality gap on these LPs in some special cases. We show that several approximation algorithms from the literature on Steiner trees can be re-interpreted through linear programs, in particular our hypergraphic relaxation yields a new view of the Robins-Zelikovsky 1.55-approximation algorithm for the Steiner tree problem. The second half of the thesis deals with a variety of fundamental problems in combinatorial optimization. We show how to apply the iterated LP relaxation framework to the problem of multicommodity integral flow in a tree, to get an approximation ratio that is asymptotically optimal in terms of the minimum capacity. Iterated relaxation gives an infeasible solution, so we need to finesse it back to feasibility without losing too much value. Iterated LP relaxation similarly gives an O(k^2)-approximation algorithm for packing integer programs with at most k occurrences of each variable; new LP rounding techniques give a k-approximation algorithm for covering integer programs with at most k variable per constraint. We study extreme points of the standard LP relaxation for the traveling salesperson problem and show that they can be much more complex than was previously known. The k-edge-connected spanning multi-subgraph problem has the same LP and we prove a lower bound and conjecture an upper bound on the approximability of variants of this problem. Finally, we show that for packing/covering integer programs with a bounded number of constraints, for any epsilon > 0, there is an LP with integrality gap at most 1 + epsilon
    corecore