Lagrangian Relaxation and Partial Cover

Simple item page
dc.creatorMestre, Julián
dc.date2007-12-23
dc.date.accessioned2026-07-07T08:51:12Z
dc.date.available2026-07-07T08:51:12Z
dc.descriptionLagrangian relaxation has been used extensively in the design of approximation algorithms. This paper studies its strengths and limitations when applied to Partial Cover.
dc.description20 pages, extended abstract appeared in STACS 2008
dc.identifierhttps://arxiv.org/abs/0712.3936
dc.identifierhttp://arxiv.org/abs/0712.3936
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144853
dc.subjectData Structures and Algorithms
dc.subjectDiscrete Mathematics
dc.subjectG.2.1
dc.titleLagrangian Relaxation and Partial Cover
dc.typetext

Files

Collections

arXiv