Lift-and-Project Methods for Set Cover and Knapsack

We study the applicability of lift-and-project methods to the Set Cover and Knapsack problems. Inspired by recent work of Karlin et al. (IPCO 2011 ), who examined this connection for Knapsack , we consider the applicability and limitations of these methods for Set Cover , as well as extend the exist...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica 2018-12, Vol.80 (12), p.3920-3942
Hauptverfasser:	Chlamtáč, Eden, Friggstad, Zachary, Georgiou, Konstantinos
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Approximation Combinatorial analysis Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematical analysis Mathematics of Computing Rounding Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!