Abstract

Monotone submodular maximization with a knapsack constraint is NP-hard. Various approximation algorithms have been devised to address this optimization problem. In this paper, we revisit the widely known modified greedy algorithm. First, we show that this algorithm can achieve an approximation factor of 0.405, which significantly improves the known factors of 0.357 given by Wolsey and (1-1/e)/2\approx 0.316 given by Khuller et al. More importantly, our analysis closes a gap in Khuller et al.'s proof for the extensively mentioned approximation factor of (1-1/\sqrte )\approx 0.393 in the literature to clarify a long-standing misconception on this issue. Second, we enhance the modified greedy algorithm to derive a data-dependent upper bound on the optimum. We empirically demonstrate the tightness of our upper bound with a real-world application. The bound enables us to obtain a data-dependent ratio typically much higher than 0.405 between the solution value of the modified greedy algorithm and the optimum. It can also be used to significantly improve the efficiency of algorithms such as branch and bound.
- Alexander A. Ageev and Maxim I. Sviridenko. 1999. An 0.828-Approximation Algorithm For the Uncapacitated Facility Location Problem. Discrete Applied Mathematics , Vol. 93, 4 (1999), 149--156.Google Scholar
Digital Library
- Ashwinkumar Badanidiyuru and Jan Vondrák. 2014. Fast Algorithms for Maximizing Submodular Functions. In Proc. SODA . 1497--1514.Google Scholar
Cross Ref
- Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, and Robert E. Tarjan. 1973. Time Bounds for Selection. J. Comput. System Sci. , Vol. 7, 4 (1973), 448--461.Google Scholar
Digital Library
- Yuri Y Boykov and Marie-Pierre Jolly. 2001. Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images. In Proc. IEEE ICCV, Vol. 1. 105--112.Google Scholar
- Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák. 2011. Maximizing a Monotone Submodular Function Subject to a Matroid Constraint. SIAM J. Comput. , Vol. 40, 6 (2011), 1740--1766.Google Scholar
Digital Library
- Michele Conforti and Gérard Cornuéjols. 1984. Submodular Set Functions, Matroids and the Greedy Algorithm: Tight Worst-case Bounds and Some Generalizations of the Rado-Edmonds Theorem. Discrete Applied Mathematics , Vol. 7, 3 (1984), 251--274.Google Scholar
Cross Ref
- Gerard Cornuejols, Marshall L Fisher, and George L Nemhauser. 1977. Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms. Management Science , Vol. 23 (1977), 789--810.Google Scholar
Digital Library
- Andrew Delong, Olga Veksler, Anton Osokin, and Yuri Boykov. 2012. Minimizing Sparse High-Order Energies by Submodular Vertex-Cover. In Proc. NeurIPS . 962--970.Google Scholar
- Alina Ene and Huy L. Nguyen. 2019. A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint. In Proc. ICALP. 53:1--53:12.Google Scholar
- Uriel Feige. 1998. A Threshold of łn n for Approximating Set Cover. J. ACM , Vol. 45, 4 (1998), 634--652.Google Scholar
Digital Library
- Boris Goldengorin, Gerard Sierksma, Gert A. Tijssen, and Michael Tso. 1999. The Data-Correcting Algorithm for the Minimization of Supermodular Functions. Management Science , Vol. 45, 11 (1999), 1539--1551.Google Scholar
Digital Library
- Kai Han, Keke Huang, Xiaokui Xiao, Jing Tang, Aixin Sun, and Xueyan Tang. 2018. Efficient Algorithms for Adaptive Influence Maximization. Proc. VLDB Endowment , Vol. 11, 9 (2018), 1029--1040.Google Scholar
Digital Library
- Keke Huang, Jing Tang, Kai Han, Xiaokui Xiao, Wei Chen, Aixin Sun, Xueyan Tang, and Andrew Lim. 2020 a. Efficient Approximation Algorithms for Adaptive Influence Maximization. The VLDB Journal , Vol. 29, 6 (2020), 1385--1406.Google Scholar
Digital Library
- Keke Huang, Jing Tang, Xiaokui Xiao, Aixin Sun, and Andrew Lim. 2020 b. Efficient Approximation Algorithms for Adaptive Target Profit Maximization. In Proc. IEEE ICDE . 649--660.Google Scholar
Cross Ref
- Stefanie Jegelka and Jeff Bilmes. 2011. Submodularity Beyond Submodular Energies: Coupling Edges in Graph Cuts. In Proc. IEEE CVPR . 1897--1904.Google Scholar
Digital Library
- David Kempe, Jon Kleinberg, and Éva Tardos. 2003. Maximizing the Spread of Influence Through a Social Network. In Proc. ACM KDD . 137--146.Google Scholar
Digital Library
- David Kempe, Jon Kleinberg, and Éva Tardos. 2005. Influential Nodes in a Diffusion Model for Social Networks. In Proc. ICALP . 1127--1138.Google Scholar
Digital Library
- Samir Khuller, Anna Moss, and Joseph Naor. 1999. The Budgeted Maximum Coverage Problem. Inform. Process. Lett. , Vol. 70, 1 (1999), 39--45.Google Scholar
Digital Library
- Chun-Wa Ko, Jon Lee, and Maurice Queyranne. 1995. An Exact Algorithm for Maximum Entropy Sampling. Operations Research , Vol. 43, 4 (1995), 684--691.Google Scholar
Digital Library
- Andreas Krause and Carlos Guestrin. 2005. Near-Optimal Nonmyopic Value of Information in Graphical Models. In Proc. UAI . 324--331.Google Scholar
- Andreas Krause and Carlos Guestrin. 2007. Near-Optimal Observation Selection using Submodular Functions. In Proc. AAAI . 1650--1654.Google Scholar
- Andreas Krause, Jure Leskovec, Carlos Guestrin, Jeanne Vanbriesen, and Christos Faloutsos. 2008a. Efficient Sensor Placement Optimization for Securing Large Water Distribution Networks. Journal of Water Resources Planning and Management , Vol. 134, 6 (2008), 516--526.Google Scholar
Cross Ref
- Andreas Krause, Ajit Singh, and Carlos Guestrin. 2008b. Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies. Journal of Machine Learning Research , Vol. 9, 3 (2008), 235--284.Google Scholar
Digital Library
- Haewoon Kwak, Changhyun Lee, Hosung Park, and Sue Moon. 2010. What is Twitter, a Social Network or a News Media?. In Proc. WWW. 591--600.Google Scholar
Digital Library
- Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne VanBriesen, and Natalie Glance. 2007. Cost-effective Outbreak Detection in Networks. In Proc. ACM KDD. 420--429.Google Scholar
Digital Library
- Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http://snap.stanford.edu/data .Google Scholar
- Hui Lin and Jeff Bilmes. 2010. Multi-Document Summarization via Budgeted Maximization of Submodular Functions. In Proc. NAACL-HLT. 912--920.Google Scholar
- Hui Lin and Jeff Bilmes. 2011. A Class of Submodular Functions for Document Summarization. In Proc. HLT . 510--520.Google Scholar
- George L. Nemhauser and Laurence A. Wolsey. 1978. Best Algorithms for Approximating the Maximum of a Submodular Set Function. Mathematics of Operations Research , Vol. 3, 3 (1978), 177--188.Google Scholar
Digital Library
- George L. Nemhauser, Laurence A. Wolsey, and Marshall L. Fisher. 1978. An Analysis of Approximations for Maximizing Submodular Set Functions-I . Mathematical Programming , Vol. 14, 1 (1978), 265--294.Google Scholar
Digital Library
- Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, and Ken-ichi Kawarabayashi. 2014. Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations. In Proc. AAAI. 138--144.Google Scholar
Digital Library
- Michael C Shewry and Henry P Wynn. 1987. Maximum Entropy Sampling. Journal of Applied Statistics , Vol. 14, 2 (1987), 165--170.Google Scholar
Cross Ref
- Maxim Sviridenko. 2004. A Note on Maximizing a Submodular Set Function Subject to a Knapsack Constraint. Operations Research Letters , Vol. 32, 1 (2004), 41--43.Google Scholar
Digital Library
- Maxim Sviridenko, Jan Vondrák, and Justin Ward. 2015. Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature. In Proc. SODA. 1134--1148.Google Scholar
Cross Ref
- Jing Tang, Keke Huang, Xiaokui Xiao, Laks V.S. Lakshmanan, Xueyan Tang, Aixin Sun, and Andrew Lim. 2019. Efficient Approximation Algorithms for Adaptive Seed Minimization. In Proc. ACM SIGMOD . 1096--1113.Google Scholar
Digital Library
- Jing Tang, Xueyan Tang, Xiaokui Xiao, and Junsong Yuan. 2018 d. Online Processing Algorithms for Influence Maximization. In Proc. ACM SIGMOD . 991--1005.Google Scholar
Digital Library
- Jing Tang, Xueyan Tang, and Junsong Yuan. 2016. Profit Maximization for Viral Marketing in Online Social Networks. In Proc. IEEE ICNP . 1--10.Google Scholar
Cross Ref
- Jing Tang, Xueyan Tang, and Junsong Yuan. 2017. Influence Maximization Meets Efficiency and Effectiveness: A Hop-Based Approach. In Proc. IEEE/ACM ASONAM. 64--71.Google Scholar
Digital Library
- Jing Tang, Xueyan Tang, and Junsong Yuan. 2018a. An Efficient and Effective Hop-Based Approach for Inluence Maximization in Social Networks. Social Network Analysis and Mining , Vol. 8, 10 (2018).Google Scholar
- Jing Tang, Xueyan Tang , and Junsong Yuan. 2018b. Profit Maximization for Viral Marketing in Online Social Networks: Algorithms and Analysis. IEEE Transactions on Knowledge and Data Engineering , Vol. 30, 6 (2018), 1095--1108.Google Scholar
Cross Ref
- Jing Tang, Xueyan Tang, and Junsong Yuan. 2018c. Towards Profit Maximization for Online Social Network Providers. In Proc. IEEE INFOCOM . 1178--1186.Google Scholar
Digital Library
- Kai Wei, Rishabh Iyer, and Jeff Bilmes. 2015. Submodularity in Data Subset Selection and Active Learning. In Proc. ICML . 1954--1963.Google Scholar
- Laurence A. Wolsey. 1982. Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems. Mathematics of Operations Research , Vol. 7, 3 (1982), 410----425.Google Scholar
Digital Library
- Yuichi Yoshida. 2016. Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint. arXiv preprint http://arxiv.org/abs/1607.04527 .Google Scholar
- Baosheng Yu, Meng Fang, Dacheng Tao, and Jie Yin. 2016. Submodular Asymmetric Feature Selection in Cascade Object Detection. In Proc. AAAI . 1387--1393.Google Scholar
Cross Ref
- Ping Zhang, Zhifeng Bao, Yuchen Li, Guoliang Li, Yipeng Zhang, and Zhiyong Peng. 2018. Trajectory-driven Influential Billboard Placement. In Proc. ACM KDD. 2748--2757.Google Scholar
Digital Library
Index Terms
Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint
Recommendations
Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint
SIGMETRICS '21: Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer SystemsMonotone submodular maximization with a knapsack constraint is NP-hard. Various approximation algorithms have been devised to address this optimization problem. In this paper, we revisit the widely known modified greedy algorithm. First, we show that ...
Non-monotone submodular maximization under matroid and knapsack constraints
STOC '09: Proceedings of the forty-first annual ACM symposium on Theory of computingSubmodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hypergraphs, certain constraint satisfaction problems, maximum entropy ...
Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint
SIGMETRICS '21Monotone submodular maximization with a knapsack constraint is NP-hard. Various approximation algorithms have been devised to address this optimization problem. In this paper, we revisit the widely known modified greedy algorithm. First, we show that ...






Comments