Lagrangian Relaxation and Partial Cover
Data Structures and Algorithms
2007-12-27 v1 Discrete Mathematics
Abstract
Lagrangian relaxation has been used extensively in the design of approximation algorithms. This paper studies its strengths and limitations when applied to Partial Cover.
Keywords
Cite
@article{arxiv.0712.3936,
title = {Lagrangian Relaxation and Partial Cover},
author = {Julián Mestre},
journal= {arXiv preprint arXiv:0712.3936},
year = {2007}
}
Comments
20 pages, extended abstract appeared in STACS 2008