Admission control with advance reservations in simple networks
Journal of Discrete Algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Elementary approximation algorithms for prize collecting Steiner tree problems
Information Processing Letters
Randomized competitive algorithms for generalized caching
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Distributed fractional packing and maximum weighted b-matching via tail-recursive duality
DISC'09 Proceedings of the 23rd international conference on Distributed computing
SIAM Journal on Computing
An Extension of the Nemhauser-Trotter Theorem to Generalized Vertex Cover with Applications
SIAM Journal on Discrete Mathematics
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
Approximation of Partial Capacitated Vertex Cover
SIAM Journal on Discrete Mathematics
Using fractional primal-dual to schedule split intervals with demands
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Distributed approximation of cellular coverage
Journal of Parallel and Distributed Computing
How to trim an MST: a 2-approximation algorithm for minimum cost tree cover
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover
ACM Transactions on Algorithms (TALG)
Extension of the nemhauser and trotter theorem to generalized vertex cover with applications
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Theoretical Computer Science
Using fractional primal-dual to schedule split intervals with demands
Discrete Optimization
Randomized Competitive Algorithms for Generalized Caching
SIAM Journal on Computing
| Hi-index | 0.00 |
We discuss two approximation paradigms that were used to construct many approximation algorithms during the last two decades, the primal-dual schema and the local ratio technique. Recently, primal-dual algorithms were devised by first constructing a local ratio algorithm and then transforming it into a primal-dual algorithm. This was done in the case of the $2$-approximation algorithms for the feedback vertex set problem and in the case of the first primal-dual algorithms for maximization problems. Subsequently, the nature of the connection between the two paradigms was posed as an open question by Williamson [Math. Program., 91 (2002), pp. 447--478]. In this paper we answer this question by showing that the two paradigms are equivalent.