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
An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A parallel approximation algorithm for positive linear programming
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
On-line algorithms for Steiner tree problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
Randomized rounding without solving the linear program
Proceedings of the sixth 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
Dynamic TCP acknowledgement and other stories about e/(e-1)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Combining fairness with throughout: online routing with multiple objectives
Journal of Computer and System Sciences - Special issue on Internet algorithms
On-Line End-to-End Congestion Control
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Tight Approximation Results for General Covering Integer Programs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
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
On-line generalized Steiner problem
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
AdWords and Generalized On-line Matching
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
A general approach to online network optimization problems
ACM Transactions on Algorithms (TALG)
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
SIAM Journal on Computing
A Primal-Dual Randomized Algorithm for Weighted Paging
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Throughput-competitive on-line routing
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Online primal-dual algorithms for covering and packing problems
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Online set packing and competitive scheduling of multi-part tasks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Proceedings of the fourth ACM international conference on Web search and data mining
Frequency capping in online advertising
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Competitive and deterministic embeddings of virtual networks
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Discrete Applied Mathematics
Randomized Competitive Algorithms for Generalized Caching
SIAM Journal on Computing
Model Predictive Control for Dynamic Resource Allocation
Mathematics of Operations Research
Approximating sparse covering integer programs online
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Geometry of online packing linear programs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Competitive and deterministic embeddings of virtual networks
Theoretical Computer Science
| 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 rounds. In an online packing problem, the profit function as well as the packing constraints are not known in advance. In each round additional information (i.e., a new variable) about the profit function and the constraints is revealed. An online algorithm needs to maintain a feasible solution in each round; in addition, the solutions generated over the different rounds need to satisfy a monotonicity property. We provide general deterministic primal-dual algorithms for online fractional covering and packing problems. We also provide deterministic algorithms for several integral online covering and packing problems. Our algorithms are designed via a novel online primal-dual technique and are evaluated via competitive analysis.