Improved deterministic algorithms for non-monotone submodular maximization (Q6168972): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4313343266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint / 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: Constrained Submodular Maximization via a Nonsymmetric Technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic (½ + <i>ε</i>)-Approximation for Submodular Maximization over a Matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Maximization with Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549682 / 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: 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: Q5365102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The budgeted maximum coverage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints / 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: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved deterministic algorithms for non-monotone submodular maximization / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:58, 2 August 2024

scientific article; zbMATH DE number 7724771
Language Label Description Also known as
English
Improved deterministic algorithms for non-monotone submodular maximization
scientific article; zbMATH DE number 7724771

    Statements

    Improved deterministic algorithms for non-monotone submodular maximization (English)
    0 references
    10 August 2023
    0 references
    submodular maximization
    0 references
    deterministic algorithms
    0 references
    matroid constraint
    0 references
    knapsack constraint
    0 references

    Identifiers