Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Optimal File Sharing in Distributed Networks
SIAM Journal on Computing
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Approximation algorithms for NP-hard problems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An extension of the Lovász local lemma, and its applications to integer programming
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
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
Approximation algorithms
A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria
SIAM Journal on Computing
Tight Approximation Results for General Covering Integer Programs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics
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
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Uncovering performance differences among backbone ISPs with Netdiff
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Limited view CT reconstruction and segmentation via constrained metric labeling
Computer Vision and Image Understanding
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Proceedings of the 28th ACM symposium on Principles of distributed computing
Detecting traffic differentiation in backbone ISPs with NetPolice
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Exact Algorithms for Set Multicover and Multiset Multicover Problems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Dynamic programming based algorithms for set multicover and multiset multicover problems
Theoretical Computer Science
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On column-restricted and priority covering integer programs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Approximating sparse covering integer programs online
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.00 |
Given matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider the problem of computing min{c^Tx:x@?Z"+^n,Ax=a,Bx==a) and multiplicity constraints (x=