On Column-Restricted and Priority Covering Integer Programs
نویسندگان
چکیده
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of covering problems. In this paper, we study the approximability of CCIPs, in particular, their relation to the integrality gaps of the underlying 0,1-CIP. If the underlying 0,1-CIP has an integrality gap O(γ), and assuming that the integrality gap of the priority version of the 0,1-CIP is O(ω), we give a factor O(γ + ω) approximation algorithm for the CCIP. Priority versions of 0,1-CIPs (PCIPs) naturally capture quality of service type constraints in a covering problem. We investigate priority versions of the line (PLC) and the (rooted) tree cover (PTC) problems. Apart from being natural objects to study, these problems fall in a class of fundamental geometric covering problems. We bound the integrality of certain classes of this PCIP by a constant. Algorithmically, we give a polytime exact algorithm for PLC, show that the PTC problem is APX-hard, and give a factor 2-approximation algorithm for it.
منابع مشابه
Partial Resampling to Approximate Covering Integer Programs
We consider column-sparse positive covering integer programs, which generalize set cover and which have attracted a long line of research developing (randomized) approximation algorithms. We develop a new rounding scheme based on the Partial Resampling variant of the Lovász Local Lemma developed by Harris & Srinivasan (2013). This achieves an approximation ratio of 1 + ln(∆1+1) amin +O( √ log(∆...
متن کاملAll-integer column generation for set partitioning: Basic principles and extensions
Column generation, combined with an appropriate integer programming technique, has shown to be a powerful tool for solving huge integer programs arising in various applications. In these column generation approaches, the master problem is often of a set partitioning type. The set partitioning polytope has the quasi-integrality property, which enables the use of simplex pivots for finding improv...
متن کاملar X iv : c s . D S / 03 07 04 3 v 1 18 J ul 2 00 3 An Extension of the Lovász Local Lemma , and its Applications to Integer Programming ∗
The Lovász Local Lemma due to Erdős and Lovász (in Infinite and Finite Sets, Colloq. Math. Soc. J. Bolyai 11, 1975, pp. 609–627) is a powerful tool in proving the existence of rare events. We present an extension of this lemma, which works well when the event to be shown to exist is a conjunction of individual events, each of which asserts that a random variable does not deviate much from its m...
متن کاملImproved Column Generation for Highly Degenerate Master Problems
Branch-and-price, that is, column generation embedded into a branch-and-bound scheme is established as a leading solution methodology for many large-scale integer programming programs. The column generation approach is a method used for solving linear problems with a huge number of variables. This classical decomposition method (Dantzig and Wolfe 1960, Gilmore and Gomory 1961, 1963) well exploi...
متن کاملAn Extension of the Lovász Local Lemma, and its Applications to Integer Programming
The Lovász Local Lemma due to Erdős and Lovász (in Infinite and Finite Sets, Colloq. Math. Soc. J. Bolyai 11, 1975, pp. 609–627) is a powerful tool in proving the existence of rare events. We present an extension of this lemma, which works well when the event to be shown to exist is a conjunction of individual events, each of which asserts that a random variable does not deviate much from its m...
متن کامل