APA (7th ed.) Citation

Amanatidis, G., Fusco, F., Lazos, P., Leonardi, S., Spaccamela, A. M., & Reiffenhäuser, R. (2021). Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity.

Chicago Style (17th ed.) Citation

Amanatidis, Georgios, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti Spaccamela, and Rebecca Reiffenhäuser. Submodular Maximization Subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. 2021.

MLA (9th ed.) Citation

Amanatidis, Georgios, et al. Submodular Maximization Subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. 2021.