The concept of Lagrangian relaxation is closely related to LP duality
and has been successfully applied to approximation algorithms for
many problems. In this talk I'll review some of positive and negative
results regarding Lagrangian relaxation when applied to Partial
Covering problems.