The online set cover problem

SIAM Journal on Computing

Volumn 39, Issue 2, 2009, Pages 361-370

  Alon, Noga ^a   Awerbuch, Baruch ^b   Azar, Yossi ^a   Buchbinder, Niv ^c   Naor, Joseph ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b Johns Hopkins University   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Competitive factor; Online; Set cover

Indexed keywords

COMPETITIVE DETERMINISTIC ALGORITHMS; COMPETITIVE FACTOR; COMPETITIVE RATIO; COMPUTATIONAL LEARNING THEORY; DETERMINISTIC ONLINE ALGORITHMS; FRACTIONAL SOLUTIONS; INPUT SEQUENCE; LOWER BOUNDS; MAXIMUM RATIO; OFFLINE; ON-LINE SET; ONLINE; ONLINE PREDICTION; ONLINE VERSIONS; SET COVER; SET COVER PROBLEM; TECHNIQUES USED; TOTAL COSTS; WINNOW ALGORITHM;

COMPUTATION THEORY; CONTROL THEORY; COSTS; GAME THEORY; LEARNING ALGORITHMS;

SET THEORY;

EID: 67650141689     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060661946     Document Type: Article

References (17)

1. N. ALON, B. AWERBUCH, Y. AZAR, N. BUCHBINDER, AND J. NAOR, The online set cover problem, in Proceedings of the 35th Annual ACM Symposium on the Theory of Computation (San Diego, 2003), ACM, New York, 2003, pp. 100-105.
2. N. ALON, B. AWERBUCH, Y. AZAR, N. BUCHBINDER, AND J. NAOR, A general approach to online network optimization problems, ACM Trans. Algorithms, 2 (2006), pp. 640-660.
3. B. AWERBUCH, Y. AZAR, A. FIAT, AND T. LEIGHTON, Making commitments in the face of uncertainty: How to pick a winner almost every time, in Proceedings of the 28th Annual ACM Symposium on the Theory of Computation (Philadelphia, 1996), ACM, New York, 1996, pp. 519-530.
4. N. BANSAL, N. BUCHBINDER, AND J. NAOR, A primal-dual randomized algorithm for weighted paging, in Proceedings of the 48rd Annual IEEE Symposium on Foundations of Computer Science (Providence, RI, 2007), IEEE Press, Piscataway, NJ, pp. 507-517.
5. A. BLUM, On-line algorithms in machine learning, in Online Algorithms: The State of the Art, A. Fiat and G. Woeginger, eds., Lecture Notes in Comput. Sci. 1442, Springer, New York, 1998, Chapter 14, pp. 306-325.
6. A. BLUM, Online learning tools for online algorithms, Dagstuhl Workshop on Online Algorithms, 2002; available online at http://www-2.cs.cmu.edu/~avrim/surveys.html.
7. A. BLUM, S. CHAWLA, AND A. KALAI, Static optimality and dynamic search-optimality in lists and trees, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 2002), SIAM, Philadelphia, 2002, pp. 1-8.
8. N. BUCHBINDER AND J. NAOR, Online primal-dual algorithms for covering and packing problems, in Proceedings of the 13th Annual European Symposium on Algorithms (Palma de Mallorca, Spain, 2005), Lecture Notes in Comput. Sci. 3669, Springer, New York, 2005, pp. 689-701. Math. Oper. Res., to appear.
9. N. BUCHBINDER, K. JAIN, AND J. NAOR, Online primal-dual algorithms for maximizing adauctions revenue, in Proceedings of the 15th Annual European Symposium on Algorithms (Eilat, Israel, 2007), Lecture Notes in Comput. Sci. 4698, Springer, New York, 2007, pp. 253-264.
10. V. CHVÁTAL, A greedy heuristic for the set-covering problem, Math. Oper. Res., 4 (1979), pp. 233-235.
11. U. FEIGE, A threshold of In n for approximating set cover, J. ACM, 45 (1998), pp. 634-652.
12. Y. FREUND AND R. E. SCHAPIRE, Game theory, on-line prediction and boosting, in Proceedings of the 9th Annual Conference on Computational Learning Theory (Desenzano del Garda, Italy, 1996), ACM, New York, 1996, pp. 325-332.
13. D. S. JOHNSON, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9 (1974), pp. 256-278.
14. A. R. KARLIN, C. KENYON, AND D. RANDALL, Dynamic TCP acknowledgement and other stories about e/(e-1), in Proceedings of the 28th Annual ACM Symposium on the Theory of Computation (Heraklion, Crete, Greece, 2001), ACM, New York, 2001, pp. 502-509.
15. N. LITTLESTONE AND M. K. WARMUTH, The weighted majority algorithm, Inform. and Comput., 108 (1994), pp. 212-261.
16. L. Lovász, On the ratio of optimal and fractional covers, Discrete Math., 13 (1975), pp. 383-390.
17. C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, J. ACM, 41 (1994), pp. 960-981.