Improved Approximation Guarantees for Packing and Covering Integer Programs
SIAM Journal on Computing
Strengthening integrality gaps for capacitated network design and covering problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
Approximation Algorithms for Single-Source Unsplittable Flow
SIAM Journal on Computing
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics
Resource optimization in QoS multicast routing of real-time multimedia
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for covering/packing integer programs
Journal of Computer and System Sciences
An Extension of the Lova´sz Local Lemma, and its Applications to Integer Programming
SIAM Journal on Computing
Multicommodity demand flow in a tree and packing integer programs
ACM Transactions on Algorithms (TALG)
On the approximability of some network design problems
ACM Transactions on Algorithms (TALG)
Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
On capacitated set cover problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Resource allocation for covering time varying demands
ESA'11 Proceedings of the 19th European conference on Algorithms
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Randomized Competitive Algorithms for Generalized Caching
SIAM Journal on Computing
Approximating sparse covering integer programs online
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Weighted geometric set multi-cover via quasi-uniform sampling
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Exact algorithms and APX-hardness results for geometric packing and covering problems
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
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.