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
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
On-line algorithms for Steiner tree problems (extended abstract)
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
On-line generalized Steiner problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Guarantees for Packing and Covering Integer Programs
SIAM Journal on Computing
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
SIAM Journal on Discrete Mathematics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Tight Approximation Results for General Covering Integer Programs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A general approach to online network optimization problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A fast approximation scheme for fractional covering problems with variable upper bounds
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Throughput-competitive on-line routing
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
ACM SIGACT News
Allocating online advertisement space with unreliable estimates
Proceedings of the 8th ACM conference on Electronic commerce
Competitiveness via primal-dual
ACM SIGACT News
Online make-to-order joint replenishment model: primal dual competitive algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized competitive algorithms for generalized caching
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Online auctions and generalized secretary problems
ACM SIGecom Exchanges
A Knapsack Secretary Problem with Applications
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Non-cooperative Cost Sharing Games Via Subsidies
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
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
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Admission control to minimize rejections and online set cover with repetitions
ACM Transactions on Algorithms (TALG)
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Online scheduling of targeted advertisements for IPTV
INFOCOM'10 Proceedings of the 29th conference on Information communications
An improved competitive algorithm for reordering buffer management
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Towards the randomized k-server conjecture: a primal-dual approach
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Metrical task systems and the k-server problem on HSTs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
How to allocate goods in an online market?
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
An O(log k)-competitive algorithm for generalized caching
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Optimal online buffer scheduling for block devices
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Dynamic power allocation under arbitrary varying channels: an online approach
IEEE/ACM Transactions on Networking (TON)
A Primal-Dual Randomized Algorithm for Weighted Paging
Journal of the ACM (JACM)
Online mechanism design (randomized rounding on the fly)
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Online scheduling of targeted advertisements for IPTV
IEEE/ACM Transactions on Networking (TON)
Dynamic covering for recommendation systems
Proceedings of the 21st ACM international conference on Information and knowledge management
Tight bounds for online vector bin packing
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints that define the feasible solution space are given one by one in an online fashion. In an online packing problem the profit function as well as the exact packing constraints are not fully known in advance. In each round additional information about the profit function and the constraints is revealed. We provide general deterministic schemes for online fractional covering and packing problems. We also provide deterministic algorithms for a couple of integral covering and packing problems.