Q5090369 (Q5090369): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Near-Optimal Algorithm for Online Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms and Analysis for Secretary Problems and Generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular secretary problem and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online submodular maximization: beating 1/2 made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Maximization with Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular maximization meets streaming: matchings, matroids, and more / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5653410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Non-monotone Submodular Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Stochastic Packing Applied to Display Ad Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Submodular Secretary Problem Goes Linear / rank
 
Normal rank
Property / cites work
 
Property / cites work: Who solved the secretary problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed is as powerful as clairvoyance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online submodular welfare maximization: Greedy is optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Submodular Welfare Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Decision Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best Algorithms for Approximating the Maximum of a Submodular Set Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal time-critical scheduling via resource augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimal Choice of a Subset of a Population / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal choice and assignment of the best \(m\) of \(n\) randomly arriving items / rank
 
Normal rank

Latest revision as of 15:33, 29 July 2024

scientific article; zbMATH DE number 7559044
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7559044

    Statements

    0 references
    0 references
    0 references
    18 July 2022
    0 references
    submodular optimization
    0 references
    secretary problem
    0 references
    streaming algorithms
    0 references

    Identifiers