Strengthening integrality gaps for capacitated network design and covering problems
Robert D. Carr,Lisa Fleischer,Vitus J. Leung,Cynthia A. Phillips +3 more
- pp 106-115
Reads0
Chats0
TLDR
The authors show that by adding additional inequalities, the ratio between the optimal integer solution and the optimal solution to the linear program relaxation can be improved significantly, and provide a polynomial-time approximation algorithm to achieve this bound.Abstract:
A capacitated covering IP is an integer program of the form min{l_brace}ex{vert_bar}Ux {ge} d, 0 {le} x {le} b, x {element_of} Z{sup +}{r_brace}, where all entries of c, U, and d are nonnegative. Given such a formulation, the ratio between the optimal integer solution and the optimal solution to the linear program relaxation can be as bad as {parallel}d{parallel}{sub {proportional_to}}, even when U consists of a single row. They show that by adding additional inequalities, this ratio can be improved significantly. In the general case, they show that the improved ratio is bounded by the maximum number of non-zero coefficients in a row of U, and provide a polynomial-time approximation algorithm to achieve this bound. This improves upon the results of Bertsimas and Vohra, strengthening their extension of Hall and Hochbaum.read more
Citations
More filters
Book
The Design of Approximation Algorithms
TL;DR: In this paper, the authors present a survey of the central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization.
Book
The Design of Competitive Online Algorithms via a Primal-Dual Approach
TL;DR: This survey shows in this survey how to extend the primal—dual method to the setting of online algorithms, and shows its applicability to a wide variety of fundamental problems.
Proceedings ArticleDOI
Facility location with nonuniform hard capacities
Martin Pál,T. Tardos,Tom Wexler +2 more
TL;DR: The authors give the first constant factor approximation algorithm for the facility location problem with nonuniform, hard capacities by presenting a local-search heuristic that yields an approximation guarantee of 9 + /spl epsi/ for the case of non uniform hard capacities.
A cutting plane algorithm for multicomoodity survivable network design problems
Geir Dahl,Mechthild Stoer +1 more
TL;DR: A cutting plane algorithm is presented for solving the following telecommunications network design problem: given point-to-point traffic demands in a network, specified survivability requirements and a discrete cost/capacity function for each link, find minimum cost capacity expansions satisfying the given demands.
Proceedings ArticleDOI
On Allocating Goods to Maximize Fairness
TL;DR: An algorithm that achieves a \tilde{O}(n^{\eps})-approximation in time n^{O(1/\eps)} for any \eps=\Omega(log log n/log n) and a poly-logarithmic approximation in quasi-polynomial time.
References
More filters
Book ChapterDOI
Reducibility Among Combinatorial Problems
TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.
Book
Knapsack Problems: Algorithms and Computer Implementations
Silvano Martello,Paolo Toth +1 more
TL;DR: This paper focuses on the part of the knapsack problem where the problem of bin packing is concerned and investigates the role of computer codes in the solution of this problem.
Book
Geometric Algorithms and Combinatorial Optimization
TL;DR: In this article, the Fulkerson Prize was won by the Mathematical Programming Society and the American Mathematical Society for proving polynomial time solvability of problems in convexity theory, geometry, and combinatorial optimization.
Book
Approximation Algorithms for NP-Hard Problems
TL;DR: This book reviews the design techniques for approximation algorithms and the developments in this area since its inception about three decades ago and the "closeness" to optimum that is achievable in polynomial time.
Journal ArticleDOI
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Oscar H. Ibarra,Chul Kim +1 more
TL;DR: An algorithm is presented which finds for any 0 < e < 1 an approximate solution P satisfying (P* P)/P* < ~, where P* is the desired optimal sum.