Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 42 for “"Integrality Gap"”.

  1. On the Integrality Gap of Directed Steiner Tree Problem

    … for any constant ε > 0. Furthermore, the integrality gap of a natural LP relaxation can be as bad as Ω(√|X|).  We demonstrate that l rounds of the Sherali-Adams hierarchy suffice to reduce the integrality gap of a natural LP relaxation for Directed Steiner Tree in l-layered graphs from Ω( …

    waterloo Repository record for On the Integrality Gap of Directed Steiner Tree Problem (opens in a new tab)

  2. The integrality gap of the asymmetric travelling salesman problem

    … costs are metric. In this thesis we study the integrality gap for the ATSP, i.e. the worst-case ratio between the ATSP and its linear programming relaxation ATSPLP. The ATSPLP provides a lower bound for the ATSP, which is useful for branch and bound solution techniques as well as for providing …

    ottawa-retro Repository record for The integrality gap of the asymmetric travelling salesman problem (opens in a new tab)

  3. An Algorithm for Stable Matching with Approximation up to the Integrality Gap

    … Our result matches the known lower bound on the integrality gap for the associated LP formulation.

    waterloo Repository record for An Algorithm for Stable Matching with Approximation up to the Integrality Gap (opens in a new tab)

  4. Cuts in Optimization and Approximation: Generalized MIR Cutting Plane and Integrality Gap Bounds for the Planar Multicut Problem

    … and certain subclasses thereof. We analyze the integrality gap of the natural LP relaxation within the framework of small-diameter decompositions. By introducing novel tools, we improve the best known lower bound on this integrality gap from $2$ to $\tfrac{20}{9}$ for the family of cactus …

    waterloo Repository record for Cuts in Optimization and Approximation: Generalized MIR Cutting Plane and Integrality Gap Bounds for the Planar Multicut Problem (opens in a new tab)

  5. On the Integrality Gap of the Subtour Relaxation of the Traveling Salesman Problem for Certain Fractional 2-matching Costs

    This thesis provides new bounds on the strength of the subtour relaxation of the Traveling Salesman Problem (TSP) for fractional 2-matching cost instances whose support graphs have no fractional cycles larger than five vertices. This work provides insight for improving approximation heuristics for …

    rice Repository record for On the Integrality Gap of the Subtour Relaxation of the Traveling Salesman Problem for Certain Fractional 2-matching Costs (opens in a new tab)

  6. Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations

    … related and common measure of efficiency is the integrality gap, which sets the limitations of the associated algorithmic schemes. A number of systematic procedures, known as lift-and-project systems, have been proposed to improve the integrality gap of standard relaxations. These systems build …

    toronto-retro Repository record for Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations (opens in a new tab)

  7. On Hierarchies of Strong SDP Relaxations for Combinatorial Optimization Problems

    … There, the measure of efficiency is the integrality gap which sets the approximation limitation of the algorithms based on these relaxations. In this work we study the integrality gap of families of strong LP and SDP relaxations for a number of combinatorial optimization problems. The …

    toronto-retro Repository record for On Hierarchies of Strong SDP Relaxations for Combinatorial Optimization Problems (opens in a new tab)

  8. A Primal Dual Algorithm On 2-Steiner Graphs

    … regarding this problem, is proving that the integrality gap of a certain linear program relaxation, called the bidirected cut relaxation (BCR), is strictly smaller than 2. In this thesis, we prove that (BCR) has integrality gap at most 5/3 for a subset of instances, which we call 2-Steiner …

    waterloo Repository record for A Primal Dual Algorithm On 2-Steiner Graphs (opens in a new tab)

  9. Approximate extended formulations for multidimensional knapsack and the unsplittable flow problem on trees

    … formulation is relaxed to a linear program, the integrality gap is O(n). Previous work on UFPT and UFPP has established that the addition of rank constraints to the linear program can be effective in some cases at reducing the integrality gap. However, Friggstad and Gao proved that even with all …

    ubc Repository record for Approximate extended formulations for multidimensional knapsack and the unsplittable flow problem on trees (opens in a new tab) Download PDF for Approximate extended formulations for multidimensional knapsack and the unsplittable flow problem on trees (opens in a new tab)

  10. Analysis of Convex Relaxations for Nonconvex Optimization

    … that of the original problem is measured by the integrality gap or duality gap, which is of central importance in convex relaxation including providing a performance limitation that one can prove for the corresponding approximation algorithm. This dissertation focuses on how to estimate such …

    cornell Repository record for Analysis of Convex Relaxations for Nonconvex Optimization (opens in a new tab)

  11. Prize-Collecting Network Design

    … we study the problem of finding the worst-case integrality gap between the traveling salesman problem and its subtour LP relaxation. We restrict ourselves to the special case in which costs between cities are either one or two. We give a proof of upper bound of 106 81 for this integrality gap. …

    cornell Repository record for Prize-Collecting Network Design (opens in a new tab)

  12. Approximation Algorithms for Network Connectivity Problems

    … and achieve improved approximation algorithm and integrality gap results for them. We introduce an important new, highly useful and applicable, network connectivity problem - the Vital Core Connectivity Problem (VCC). Despite its many practical uses, this problem has not been previously studied. …

    ottawa-retro Repository record for Approximation Algorithms for Network Connectivity Problems (opens in a new tab)

  13. Fantastic Relaxations of the TSP and How to Bound them: Relaxations of the Traveling Salesman Problem and their Integrality Gaps

    … analysis of this linear program's \emph{integrality gap} (which dictates its use in proving approximation guarantees) has not been improved in nearly 40 years of active research. This thesis contributes to two main avenues of TSP research towards breaking these bottlenecks, both of which …

    cornell Repository record for Fantastic Relaxations of the TSP and How to Bound them: Relaxations of the Traveling Salesman Problem and their Integrality Gaps (opens in a new tab)

  14. Algorithms for Integer Programming and Allocation

    … or maximizing the minimum load. We study the integrality gap of a particularly strong linear programming relaxation, the configuration LP, for variations of this problem. The integrality gap can be seen as a measure of strength of an LP relaxation. A local search technique can be used to bound …

    cau-kiel Repository record for Algorithms for Integer Programming and Allocation (opens in a new tab)

  15. Towards New Bounds for the 2-Edge Connected Spanning Subgraph Problem

    … a fast manner. In this thesis, we focus on the integrality gap αmulti-2EC of multi-2EC^LP , which is a measure of the quality of multi-2EC^LP as a lower bound. Although we currently only know cost that 6/5 ≤ αmulti-2EC_cost ≤ 3 , the integrality gap for multi-2EC_cost has been conjectured to be …

    ottawa-retro Repository record for Towards New Bounds for the 2-Edge Connected Spanning Subgraph Problem (opens in a new tab)

  16. Algorithms for stable matching with indifferences

    … L]) [superscript L], is an upper bound on the integrality gap, which matches the known lower bound. For the case of one-sided ties where the maximum tie length is two, our result implies an approximation ratio and integrality gap of [5 over 4], which matches the known UG-hardness result.

    texas Repository record for Algorithms for stable matching with indifferences (opens in a new tab)

  17. Intractability results for problems in computational learning and approximation

    … as Maximum Cut and Sparsest Cut by constructing integrality gap examples for them. For Maximum Cut and Sparsest Cut we construct examples -- with gaps alpha[superscript{-1}] - ε (alpha is the Goemans-Williamson constant) and Omega((logloglog n)[superscript{1/13}]) respectively -- for the standard …

    gatech Repository record for Intractability results for problems in computational learning and approximation (opens in a new tab)

  18. Point cover problem in 3D

    … bounds. This method is used to strengthen the integrality gap of a problem. Our experimental results show that the Lagrangian relaxation method gives very good lower bounds at reasonable computational cost. We present a hybrid method where the Lift-and-Project LP is solved using the Subgradient …

    lethbridge Repository record for Point cover problem in 3D (opens in a new tab)

  19. Unique Games Conjecture : the Boolean Hypercube and connections to graph lifts

    … on the Hypercube. We construct an almost optimal integrality gap instance on the Hypercube for the Goemans-Williamson semidefinite program (SDP) for Max-2-LIN(\Z_2). We conjecture that augmenting the SDP with triangle inequalities makes the SDP exact upto constants on the Hypercube. We further …

    uiuc Repository record for Unique Games Conjecture : the Boolean Hypercube and connections to graph lifts (opens in a new tab)

  20. Online and offline algorithms for circuit switch scheduling

    … relaxation for the problem has an unbounded integrality gap, we adopt a hybrid approach that combines the combinatorial greedy with randomized rounding of a different suitable linear program. For the online version of the problem, we present a (bi-criteria) ((e-1)/(2e-1)-epsilon)-competitive …

    gatech Repository record for Online and offline algorithms for circuit switch scheduling (opens in a new tab)

Page 1 of 3