Robust Monotone Submodular Function Maximization (Q3186512): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / 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: From query complexity to computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Non-monotone Submodular Functions / 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: Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3112637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096214 / 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: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / 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: Symmetry and Approximability of Submodular Maximization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular function maximization via the multilinear relaxation and contention resolution schemes / rank
 
Normal rank

Latest revision as of 09:03, 12 July 2024

scientific article
Language Label Description Also known as
English
Robust Monotone Submodular Function Maximization
scientific article

    Statements

    Robust Monotone Submodular Function Maximization (English)
    0 references
    0 references
    0 references
    0 references
    10 August 2016
    0 references

    Identifiers