Structured Robust Submodular Maximization: Offline and Online Algorithms (Q5084617): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3131437153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pipage rounding: a new method of constructing algorithms with proven performance guarantee / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for maximizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Algorithms for Submodular Maximization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Maximization with Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3188607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Monotone Submodular Function Subject to a Matroid Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Continuous Greedy Algorithm for Submodular Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4196269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for online decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Groups in Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-monotone submodular maximization under matroid and knapsack constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Monotone Submodular Function Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on maximizing a submodular set function subject to a knapsack constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the greedy algorithm for the submodular set covering problem / rank
 
Normal rank

Latest revision as of 12:12, 29 July 2024

scientific article; zbMATH DE number 7549352
Language Label Description Also known as
English
Structured Robust Submodular Maximization: Offline and Online Algorithms
scientific article; zbMATH DE number 7549352

    Statements

    Structured Robust Submodular Maximization: Offline and Online Algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 2022
    0 references
    0 references
    submodular optimization
    0 references
    robust optimization
    0 references
    matroid constraints
    0 references
    greedy algorithm
    0 references
    online learning
    0 references
    0 references