Amanatidis Georgios, Federico Fusco, Lazos Filippos, Leonardi Stefano, Marchetti-Spaccamela Alberto, Rebecca Reiffenhäuser, Amanatidis, G., Fusco, F., Lazos, F., Leonardi, S., MARCHETTI SPACCAMELA, A., & Reiffenhäuser R. (2021, Januar 1). Submodular maximization subject to a knapsack constraint: combinatorial algorithms with near-optimal adaptive complexity. Gehalten auf der. PMLR.

AMANATIDIS GEORGIOS, FEDERICO FUSCO, LAZOS FILIPPOS, LEONARDI STEFANO, MARCHETTI-SPACCAMELA ALBERTO, Rebecca Reiffenhäuser, AMANATIDIS, Georgio, FUSCO, Federico, LAZOS, Filippo, LEONARDI, Stefano, MARCHETTI SPACCAMELA, Alberto und Reiffenhäuser Rebecca, 2021. Submodular maximization subject to a knapsack constraint: combinatorial algorithms with near-optimal adaptive complexity. In: . PMLR. 1 Januar 2021.

Amanatidis Georgios, Federico Fusco, Lazos Filippos, Leonardi Stefano, Marchetti-Spaccamela Alberto, Rebecca Reiffenhäuser, G. Amanatidis, F. Fusco, F. Lazos, S. Leonardi, A. MARCHETTI SPACCAMELA, und Reiffenhäuser R. Submodular maximization subject to a knapsack constraint: combinatorial algorithms with near-optimal adaptive complexity. PMLR, 2021.

Amanatidis Georgios, Federico Fusco, Lazos Filippos, Leonardi Stefano, Marchetti-Spaccamela Alberto, Rebecca Reiffenhäuser, Amanatidis, G., Fusco, F., Lazos, F., Leonardi, S., MARCHETTI SPACCAMELA, A. und Reiffenhäuser R. (2021), „Submodular maximization subject to a knapsack constraint: combinatorial algorithms with near-optimal adaptive complexity“, in , Bd. , PMLR.