The view selection problem for XML content based routing
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics
Approximation algorithms for covering/packing integer programs
Journal of Computer and System Sciences
Asking the right questions: model-driven optimization using probes
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Infrastructure Leasing Problems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Online Primal-Dual Algorithms for Covering and Packing
Mathematics of Operations Research
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
An improved approximation algorithm for vertex cover with hard capacities
Journal of Computer and System Sciences
An improved approximation algorithm for vertex cover with hard capacities
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
How to probe for an extreme value
ACM Transactions on Algorithms (TALG)
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
Theoretical Computer Science
Online primal-dual algorithms for covering and packing problems
ESA'05 Proceedings of the 13th annual European conference on Algorithms
On the placement of active monitor in IP network
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Submodular integer cover and its application to production planning
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Stochastic covering and adaptivity
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Set cover revisited: hypergraph cover with hard capacities
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |
In this paper we study approximation algorithms for solving a general covering integer program. An n-vector x of nonnegative integers is sought, which minimizes cT 驴 x; subject to Ax \geqslant b,x \leqslant d: The entries of A; b; c are nonnegative. Let m be the number of rows of A: Covering problems have been heavily studied in combinatorial optimization. We focus on the effect of the multiplicity constraints, x \leqslant d; on approximability. Two longstanding open questions remain for this general formulation with upper bounds on the variables.(i) The integrality gap of the standard LP relaxation is arbitrarily large. Existing approximation algorithms that achieve the well-known O(logm)-approximation with respect to the LP value do so at the expense of violating the upper bounds on the variables by the same O(logm) multiplicative factor. What is the smallest possible violation of the upper bounds that still achieves cost within O(logm) of the standard LP optimum?(ii) The best known approximation ratio for the problem has been 0(\log (\max _j \sum\nolimits_i {A_{ij} })) since 1982. This bound can be as bad as polynomial in the input size. Is an O(logm)-approximation, like the one known for the special case of Set Cover, possible?We settle these two open questions. To answer the first question we give an algorithm based on the relatively simple new idea of randomly rounding variables to smaller-than integerunits. To settle the second question we give a reduction from approximating the problem while respecting multiplicity constraints to approximating the problem with a bounded violation of the multiplicity constraints.