Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints (Q5002619)
From MaRDI portal
![]() | 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: Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints |
scientific article; zbMATH DE number 7375821
Language | Label | Description | Also known as |
---|---|---|---|
English | Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints |
scientific article; zbMATH DE number 7375821 |
Statements
28 July 2021
0 references
secretary problem
0 references
online algorithms
0 references
submodular maximization
0 references
0 references
0 references
0 references
Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints (English)
0 references