Amanatidis, G., Fusco, F., Lazos, P., Leonardi, S., Marchetti-Spaccamela, A., & Reiffenhäuser, R. (2026). Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity. Theoretical computer science, 1060, 115629. https://doi.org/10.1016/j.tcs.2025.115629
Citace podle Chicago (17th ed.)Amanatidis, Georgios, Federico Fusco, Philip Lazos, Stefano Leonardi, Alberto Marchetti-Spaccamela, a Rebecca Reiffenhäuser. "Submodular Maximization Subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity." Theoretical Computer Science 1060 (2026): 115629. https://doi.org/10.1016/j.tcs.2025.115629.
Citace podle MLA (9th ed.)Amanatidis, Georgios, et al. "Submodular Maximization Subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity." Theoretical Computer Science, vol. 1060, 2026, p. 115629, https://doi.org/10.1016/j.tcs.2025.115629.