Harold N. Gabow, Michel X. Goemans, et al.
Mathematical Programming, Series B
In this survey, we give an overview of a technique used to design and analyze algorithms that provide approximate solutions to NP-hard problems in combinatorial optimization. Because of parallels with the primal-dual method commonly used in combinatorial optimization, we call it the primal-dual method for approximation algorithms. We show how this technique can be used to derive approximation algorithms for a number of different problems, including network design problems, feedback vertex set problems, and facility location problems.
Harold N. Gabow, Michel X. Goemans, et al.
Mathematical Programming, Series B
Ronald Fagin, Ravi Kumar, et al.
WWW 2003
David P. Williamson, Michel X. Goemans, et al.
Combinatorica
Sanjeev Khanna, Madhu Sudan, et al.
SIAM Journal on Computing