On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique

We discuss two approximation approaches, the primal-dual schema and the local-ratio technique. We present two relatively simple frameworks, one for each approach, which extend known frameworks for covering problems. We show that the two are equivalent, and conclude that the integrality gap of an integer program serves as a bound to the approximation ratio when working with the local-ratio technique.

• Type: Conference
• Year: 2001
• Where: RANDOM
• Authors: Reuven Bar-Yehuda, Dror Rawitz
• Keywords: Local-ratio Technique, Primal-dual Schema, RANDOM 2001, Simple Frameworks, Theoretical Computer Science