(2021, March). Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint. Proceedings of the ACM on measurement and analysis of computing systems. https://doi.org/10.1145/3447386
Chicago Style (17th ed.) Citation"Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint." Proceedings of the ACM on Measurement and Analysis of Computing Systems Mar. 2021. https://doi.org/10.1145/3447386.
MLA (9th ed.) Citation"Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint." Proceedings of the ACM on Measurement and Analysis of Computing Systems, Mar. 2021, https://doi.org/10.1145/3447386.
Warning: These citations may not always be 100% accurate.