Lagrangian Relaxation and Partial Cover

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Lagrangian relaxation has been used extensively in the design of approximation algorithms. This paper studies its strengths and limitations when applied to Partial Cover.
20 pages, extended abstract appeared in STACS 2008

Keywords

Data Structures and Algorithms, Discrete Mathematics, G.2.1

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/144853

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0712.3936
 http://arxiv.org/abs/0712.3936

Collections

arXiv