Online submodular maximization: beating 1/2 made simple (Q5918911)

From MaRDI portal
Revision as of 22:06, 25 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126460829, #quickstatements; #temporary_batch_1721940658196)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    title
    Online submodular maximization: beating 1/2 made simple (English)
    0 references
    author
    Niv Buchbinder
    0 references
    Moran Feldman
    0 references
    Yuval Filmus
    0 references
    Mohit Garg
    0 references
    publication date
    28 August 2020
    0 references
    6 February 2020
    0 references
    zbMATH Keywords
    submodular optimization
    0 references
    online auctions
    0 references
    greedy algorithms
    0 references
    cites work
    Q5365114
    0 references
    Q3002824
    0 references
    Q4196269
    0 references
    Q3579420
    0 references

    Identifiers

    zbMATH Open document ID
    1453.68215
    0 references
    1436.90134
    0 references
    Mathematics Subject Classification ID
    68W27
    0 references
    90C27
    0 references
    90C30
    0 references
    91B26
    0 references
    zbMATH DE Number
    7241651
    0 references
    7164352
    0 references
    OpenAlex ID
    W2951195910
    0 references
    W2883184872
    0 references
    arXiv ID
    1807.05529
    0 references
    Wikidata QID
    Q126460829
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5918911&oldid=36687677"
    Powered by MediaWiki