Online submodular maximization: beating 1/2 made simple (Q5918911)
From MaRDI portal
(Redirected from Item:Q5919381)
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Online submodular maximization: beating 1/2 made simple |
scientific article; zbMATH DE number 7164352
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Online submodular maximization: beating 1/2 made simple |
scientific article; zbMATH DE number 7164352 |
Statements
Online submodular maximization: beating 1/2 made simple (English)
0 references
28 August 2020
0 references
6 February 2020
0 references
submodular optimization
0 references
online auctions
0 references
greedy algorithms
0 references
0 references
0 references
0.93044806
0 references
0.93044806
0 references
0.91355956
0 references
0.91355956
0 references
0.90502125
0 references
0 references
0.8925328
0 references
0.88787436
0 references