• Corpus ID: 12170801

The primal-dual method for approximation algorithms and its application to network design problems

  title={The primal-dual method for approximation algorithms and its application to network design problems},
  author={Michel X. Goemans and David P. Williamson},
In the last four decades, combinatorial optimization has been strongly influenced by linear programming. With the mathematical and algorithmic understanding of linear programs came a whole host of ideas and tools that were then applied to combinatorial optimization. Many of these ideas and tools are still in use today, and form the bedrock of our understanding of combinatorial optimization. One of these tools is the primal-dual method. It was proposed by Dantzig, Ford, and Fulkerson [DFF56] as… 
The primal-dual method for approximation algorithms
An overview of a technique used to design and analyze algorithms that provide approximate solutions to NP-hard problems in combinatorial optimization called the primal-dual method for approximation algorithms, which can be used to derive approximation algorithms for a number of different problems.
A Short Primer on the Primal-Dual Method for Approximation Algorithms (Algorithm Engineering as a New Paradigm)
This primer gives a general overview of a technique used to design and analyze algorithms that provide approximate solutions to $NP$-hard problems in combinatorial optimization and shows how it can be used to derive approximation algorithms for a number of different problems.
Enhancing techniques in lp based approximation algorithms
This thesis consists of three parts, the first two discussing enhancements of both basic techniques, rounding and primal dual schema, and the third, adapting the technique of Lagrangian relaxation in the context of approximation algorithms.
Csc5160: Combinatorial Optimization and Approximation Algorithms Topic: Primal Dual Method
In this lecture, the focus is on primal dual method and its application in designing exact algorithms and approximation algorithms for combinatorial optimization problems. It is a general framework
Using Combinatorial and LP-based Methods to Design Approximation Algorithms
The goal in this proposal is to improve the best performance guarantee and/or running time of approximation algorithms for fundamental combinatorial optimization problems and to explore the connection between the local ratio technique and linear programming.
Approximation algorithms via the primal-dual schema: applications of the simple dual-ascent method to problems from logistics
The primal-dual schema has been employed to provide approximation algorithms for a large variety of combinatorial optimization problems. This technique relies upon simultaneously constructing a
Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization
This work shows some new techniques that enhance the already-substantial corpus of LP-based approximation methods, and shows 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.
Approximation algorithms to the network design problems
This thesis treats combinatorial optimization problems related to the network design, and examines the structures and algorithms of them from the view point of the approximability, and considers problems with the edge-connectivity requirement and degree bounds.
Energy Minimization via a Primal-Dual Algorithm for a Convex Program
We present an optimal primal-dual algorithm for the energy minimization preemptive open-shop problem in the speed-scaling setting. Our algorithm uses the approach of Devanur et al. [JACM 2008], by
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
The evolution path of the local ratio technique is traced since its inception in the 1980's, culminating with the most recent development, namely, fractional local ratio, which can be viewed as a new LP rounding technique.


From valid inequalities to heuristics: a unified view of primal-dual approximation algorithms in covering problems
A generic primal-dual framework to design and analyze approximation algorithms for integer programming problems of the covering type that uses valid inequalities in its design and attaining the best worst-case bound known in the literature is proposed.
Combinatorial Optimization: Algorithms and Complexity
This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient
A primal-dual approximation algorithm for generalized steiner network problems
The first polynomial-time approximation algorithm for finding a minimum-cost subgraph having at least a specified number of edges in each cut is presented, which shows the importance of this technique in designing approximation algorithms.
A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
This work develops a family of dual-ascent algorithms that generalizes known ascent procedures for solving shortest path, plant location, Steiner network and directed spanning tree problems and generates solutions that are guaranteed to be within 1 to 4% of optimality.
.879-approximation algorithms for MAX CUT and MAX 2SAT
This research presents randomized approximation algorithms for the MAX CUT and MAX 2SAT problems that always deliver solutions of expected value at least .87856 times the optimal value and represents the first use of semidefinite programming in the design of approximation algorithms.
Improved approximation algorithms for network design problems
This paper presents an approximation algorithm with a performance guarantee of 2TH(fmax) = 2(1 + $ + g +) where fmax is the maximum requirement, and improves upon the best previously known performance guarantees of 2fmax.
A Dual-Based Procedure for Uncapacitated Facility Location
This approach has obtained and verified optimal solutions to all the Kuehn-Hamburger location problems in well under 0.1 seconds each on an IBM 360/91 computer, with no branching required.
Approximate max-flow min-(multi)cut theorems and their applications
The proof technique provides a unified framework in which one can also analyse the case of flows with specified demands of Leighton and Rao and Klein et al. and thereby obtain an improved bound for the latter problem.
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
A randomized algorithm for transforming an optimal solution of a relaxed problem into a provably good solution for the 0–1 problem is given and can be extended to provide bounds on the disparity between the rational and 0-1 optima for a given problem instance.