A linear-time streaming algorithm for cardinality-constrained maximizing monotone non-submodular set functions (Q2149859): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Online Submodular Maximization with Preemption / 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: Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-way communication complexity of submodular maximization with applications to streaming and robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric monotone function maximization with matroid constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-submodular streaming maximization with minimum memory and low adaptive complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for maximizing monotone nonsubmodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximize a monotone function with a generic submodularity ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-submodular maximization on massive data streams / rank
 
Normal rank

Latest revision as of 11:44, 29 July 2024

scientific article
Language Label Description Also known as
English
A linear-time streaming algorithm for cardinality-constrained maximizing monotone non-submodular set functions
scientific article

    Statements

    A linear-time streaming algorithm for cardinality-constrained maximizing monotone non-submodular set functions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 June 2022
    0 references
    non-submodular
    0 references
    streaming
    0 references
    linear-time
    0 references
    cardinality-constrained
    0 references

    Identifiers