Anupam Gupta
ABSTRACT
In this paper, we give new results for the set cover problem in the fully dynamic model. In this model, the set of "active" elements to be covered changes over time. The goal is to maintain a near-optimal solution for the currently active elements, while making few changes in each timestep. This model is popular in both dynamic and online algorithms: in the former, the goal is to minimize the update time of the solution, while in the latter, the recourse (number of changes) is bounded. We present generic techniques for the dynamic set cover problem inspired by the classic greedy and primal-dual offline algorithms for set cover. The former leads to a competitive ratio of O(lognt), where nt is the number of currently active elements at timestep t, while the latter yields competitive ratios dependent on ft, the maximum number of sets that a currently active element belongs to. We demonstrate that these techniques are useful for obtaining tight results in both settings: update time bounds and limited recourse, exhibiting algorithmic techniques common to these two parallel threads of research.
- Abboud, A., and Williams, V. V. Popular conjectures imply strong lower bounds for dynamic problems. In FOCS (2014), pp. 434–443. Google Scholar
Digital Library
- Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., and Naor, J. The online set cover problem. SIAM J. Comput. 39, 2 (2009), 361–370. Google ScholarDigital Library
- Andrews, M., Goemans, M. X., and Zhang, L. Improved bounds for on-line load balancing. Algorithmica 23, 4 (1999), 278–301.Google ScholarCross Ref
- Azar, Y., Broder, A. Z., and Karlin, A. R. On-line load balancing. Theoretical Computer Science 130, 1 (1994), 73–84. Google ScholarDigital Library
- Azar, Y., Kalyanasundaram, B., Plotkin, S. A., Pruhs, K., and Waarts, O. Online load balancing of temporary tasks. In Proceedings of the 1993 Workshop on Algorithms and Data Structures (1993). Google ScholarDigital Library
- Baswana, S., Gupta, M., and Sen, S. Fully dynamic maximal matching in O(log n) update time. SIAM J. Comput. 44, 1 (2015), 88–113. Google ScholarDigital Library
- Bernstein, A., and Stein, C. Fully dynamic matching in bipartite graphs. In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I (2015), pp. 167–179.Google Scholar
- Bernstein, A., and Stein, C. Faster fully dynamic matchings with small approximation ratios. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 (2016), pp. 692–711. Google ScholarDigital Library
- Bhattacharya, S., Chakrabarty, D., and Henzinger, M. Deterministic fully dynamic approximate vertex cover and fractional matching in o(1) amortized update time. In ArXiv Pre-print dated 1st November (2016).Google Scholar
- Bhattacharya, S., Henzinger, M., and Italiano, G. F. Design of dynamic algorithms via primal-dual method. In Automata, languages, and programming. Part I, vol. 9134 of Lecture Notes in Comput. Sci. Springer, Heidelberg, 2015, pp. 206–218.Google Scholar
- Bhattacharya, S., Henzinger, M., and Italiano, G. F. Deterministic fully dynamic data structures for vertex cover and matching. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (2015), SIAM, Philadelphia, PA, pp. 785–804. Google ScholarDigital Library
- Bhattacharya, S., Henzinger, M., and Nanongkai, D. New deterministic approximation algorithms for fully dynamic matching. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016 (2016), pp. 398–411. Google ScholarDigital Library
- Bosek, B., Leniowski, D., Sankowski, P., and Zych, A. Online bipartite matching in offline time. In FOCS (2014), pp. 384–393. Google ScholarDigital Library
- Chaudhuri, K., Daskalakis, C., Kleinberg, R. D., and Lin, H. Online bipartite perfect matching with augmentations. In INFOCOM (2009), pp. 1044–1052.Google ScholarCross Ref
- Dinur, I., and Steurer, D. Analytical approach to parallel repetition. In STOC’14—Proceedings of the 2014 ACM Symposium on Theory of Computing. ACM, New York, 2014, pp. 624–633. Google ScholarDigital Library
- Eppstein, D., Galil, Z., and Italiano, G. F. Dynamic graph algorithms. In Algorithms and theory of computation handbook. CRC, Boca Raton, FL, 1999, pp. 8–1–8–25.Google Scholar
- Epstein, L., and Levin, A. Robust algorithms for preemptive scheduling. In ESA, vol. 6942 of Lecture Notes in Comput. Sci. Springer, Heidelberg, 2011, pp. 567–578. Google ScholarDigital Library
- Grove, E. F., Kao, M.-Y., Krishnan, P., and Vitter, J. S. Online perfect matching and mobile computing. In WADS (1995), pp. 194–205. Google ScholarDigital Library
- Gu, A., Gupta, A., and Kumar, A. The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online. In Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing (2013), D. Bonesh, J. Feigenbaum, and T. Roughgarden, Eds., STOC ’13, ACM, pp. 525–534. Google ScholarDigital Library
- Gupta, A., Krishnaswamy, R., Kumar, A., and Panigrahi, D. Online and dynamic algorithms for set cover. CoRR abs/1611.05646 (2016).Google Scholar
- Gupta, A., and Kumar, A. Online steiner tree with deletions. In SODA (Jan 2014), pp. 455–467. Google ScholarDigital Library
- Gupta, A., Kumar, A., and Stein, C. Maintaining assignments online: Matching, scheduling, and flows. In SODA (2014), pp. 468–479. Google ScholarDigital Library
- Gupta, M., and Peng, R. Fully dynamic (1 + ϵ)-approximate matchings. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA (2013), pp. 548–557. Google ScholarDigital Library
- Henzinger, M., Krinninger, S., Nanongkai, D., and Saranurak, T. Unifying and strengthening hardness for dynamic problems via the online matrix-vector STOC’17, June 2017, Montreal, Canada Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, and Debmalya Panigrahi multiplication conjecture. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015 (2015), pp. 21–30. Google ScholarDigital Library
- Imase, M., and Waxman, B. M. Dynamic Steiner tree problem. SIAM J. Discrete Math. 4, 3 (1991), 369–384.Google ScholarCross Ref
- Kopelowitz, T., Pettie, S., and Porat, E. Higher lower bounds from the 3sum conjecture. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 (2016), pp. 1272–1287. Google ScholarDigital Library
- Korman, S. On the use of randomization in the online set cover problem. M.S. thesis, Weizmann Institute of Science (2005).Google Scholar
- Łacki, J., Oćwieja, J., Pilipczuk, M., Sankowski, P., and Zych, A. The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing (New York, NY, USA, 2015), STOC ’15, ACM, pp. 11–20. Google ScholarDigital Library
- Megow, N., Skutella, M., Verschae, J., and Wiese, A. The power of recourse for online MST and TSP. In ICALP (1) (2012), pp. 689–700. Google ScholarDigital Library
- Neiman, O., and Solomon, S. Simple deterministic algorithms for fully dynamic maximal matching. ACM Trans. Algorithms 12, 1 (2016), 7. Google ScholarDigital Library
- Onak, K., and Rubinfeld, R. Maintaining a large matching and a small vertex cover. In Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010 (2010), pp. 457–464. Google ScholarDigital Library
- Phillips, S., and Westbrook, J. On-line load balancing and network flow. Algorithmica 21, 3 (1998), 245–261.Google ScholarCross Ref
- Pitt, L. A simple probabilistic approximation algorithm for vertex cover. Tech. Rep. YaleU/DCS/TR-404, Yale University, 1985.Google Scholar
- Sanders, P., Sivadasan, N., and Skutella, M. Online scheduling with bounded migration. Math. Oper. Res. 34, 2 (2009), 481–498. Google ScholarDigital Library
- Sankowski, P. Faster dynamic matchings and vertex connectivity. In SODA (2007), pp. 118–126. Google ScholarDigital Library
- Skutella, M., and Verschae, J. A robust PTAS for machine covering and packing. In ESA (I), vol. 6346 of LNCS. Springer, Berlin, 2010, pp. 36–47. Google ScholarDigital Library
- Solomon, S. Fully dynamic maximal matching in constant update time. In FOCS (2016).Google Scholar
- Westbrook, J. Load balancing for response time. J. Algorithms 35, 1 (2000), 1–16. Google ScholarDigital Library
- Williamson, D. P., and Shmoys, D. B. The design of approximation algorithms. Cambridge University Press, Cambridge, 2011. Google ScholarDigital Library
Index Terms
- Online and dynamic algorithms for set cover
Recommendations
Dynamic set cover: improved algorithms and lower bounds
STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of ComputingWe give new upper and lower bounds for the dynamic set cover problem. First, we give a (1+є) f-approximation for fully dynamic set cover in O(f2logn/є5) (amortized) update time, for any є > 0, where f is the maximum number of sets that an element ...
Randomized Online Algorithms for Set Cover Leasing Problems
Combinatorial Optimization and ApplicationsAbstractIn the leasing variant of Set Cover presented by Anthony et al. [1], elements arrive over time and must be covered by sets from a family of subsets of . Each set can be leased for different periods of time. Let and . Leasing a set for a ...
Robust Online Algorithms for Certain Dynamic Packing Problems
Approximation and Online AlgorithmsAbstractOnline algorithms that allow a small amount of migration or recourse have been intensively studied in the last years. They are essential in the design of competitive algorithms for dynamic problems, where objects can also depart from the instance. ...
Comments