Online constrained optimization with recourse

Authors:
T. Avitabile;C. Mathieu;L. Parkinson
Affiliations:
Department of Computer Science, NYU, 251 Mercer Street, New York, NY 10012, United States and Department of Computer Science, Brown University, 115 Waterman Street, Providence, RI 02912, United St ...;Department of Computer Science, Brown University, 115 Waterman Street, Providence, RI 02912, United States;Department of Computer Science, Brown University, 115 Waterman Street, Providence, RI 02912, United States
Venue:
Information Processing Letters
Year:
2013

Citing 7
Cited 0

An optimal algorithm for on-line bipartite matching

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Online computation and competitive analysis

Online computation and competitive analysis
The all-or-nothing multicommodity flow problem

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
AdWords and generalized online matching

Journal of the ACM (JACM)
Throughput-competitive on-line routing

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
The Design of Competitive Online Algorithms via a Primal: Dual Approach

Foundations and Trends® in Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

We study online packing and covering problems, stated as zero-one linear programs. This class of problems includes maximum cut, bipartite matching, and set cover. In the packing problem, variables arrive in an online fashion. Upon arrival of v, the weight of v in the objective function and in any constraints involving v is revealed and the algorithm may update its solution. In the covering problem, constraints arrive in an online fashion. We allow the relaxation that the algorithm may change the value of each variable a constant number of times, k. We give an algorithm for OnlinePacking(k) and prove that for any @e0, there exists some k equal to O@?(1/@e) such that the algorithm gives a (1-@e) approximation for OnlinePacking(k). We then show near-tightness for several cases. We also prove that no deterministic algorithm exists for OnlineCovering(k) that achieves a competitive ratio less than 3/2.