On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
Abstract: We consider the celebrated bound introduced by Conforti and Cornu\'ejols (1984) for greedy schemes in submodular optimization. The bound assumes a submodular function defined on a collection of sets forming a matroid and is based on greedy curvature. We show that the bound holds for a very general class of string problems that includes maximizing submodular functions over set matroids as a special case. We also derive a bound that is computable in the sense that they depend only on quantities along the greedy trajectory. We prove that our bound is superior to the greedy curvature bound of Conforti and Cornu\'ejols. In addition, our bound holds under a condition that is weaker than submodularity.
- G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher, “An analysis of approximations for maximizing submodular set functions—I,” Math. Program., vol. 14, pp. 265–294, 1978.
- M. Conforti and G. Cornuéjols, “Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem,” Discrete. Appl. Math., vol. 7, no. 3, pp. 251–274, 1984.
- J. Vondrák, “Submodularity and curvature: The optimal algorithm (combinatorial optimization and discrete algorithms),” RIMS Kokyuroku Bessatsu B, vol. 23, pp. 253–266, 2010.
- G. Calinescu, C. Chekuri, M. Pal, and J. Vondrák, “Maximizing a monotone submodular function subject to a matroid constraint,” SIAM J. Comput., vol. 40, no. 6, pp. 1740–1766, 2011.
- Z. Wang, B. Moran, X. Wang, and Q. Pan, “Approximation for maximizing monotone non-decreasing set functions with a greedy method,” J. Comb. Optim., vol. 31, pp. 29–43, 2016.
- S. Welikala, C. G. Cassandras, H. Lin, and P. J. Antsaklis, “A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems,” Automatica, vol. 144, p. 110493, 2022.
- Z. Zhang, E. K. P. Chong, A. Pezeshki, and W. Moran, “String submodular functions with curvature constraints,” IEEE Trans. Autom. Control, vol. 61, no. 3, pp. 601–616, 2015.
- S. Alaei, A. Makhdoumi, and A. Malekian, “Maximizing sequence-submodular functions and its application to online advertising,” Manage. Sci., vol. 67, no. 10, pp. 6030–6054, 2021.
- B. Van Over, B. Li, E. K. Chong, and A. Pezeshki, “An improved greedy curvature bound in finite-horizon string optimization with an application to a sensor coverage problem,” in Proc. 62nd IEEE Conf. Decision Control (CDC), Singapore, Dec. 2023, pp. 1257–1262.
- M. Streeter and D. Golovin, “An online algorithm for maximizing submodular functions,” in Proc. Adv. in Neural Inf. Process. Syst. 21 (NIPS 2008), vol. 21, Vancouver, BC, Canada, Dec. 2008, pp. 1577–1584.
- Y. Liu, Z. Zhang, E. K. P. Chong, and A. Pezeshki, “Performance bounds with curvature for batched greedy optimization,” J. Optim. Theory Appl., vol. 177, pp. 535–562, 2018.
- M. Zhong and C. G. Cassandras, “Distributed coverage control and data collection with mobile sensor networks,” IEEE Trans. Autom. Control, vol. 56, no. 10, pp. 2445–2455, 2011.
- X. Sun, C. G. Cassandras, and X. Meng, “Exploiting submodularity to quantify near-optimality in multi-agent coverage problems,” Automatica, vol. 100, pp. 349–359, 2019.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
