Stochastic-lazier-greedy algorithm for monotone non-submodular maximization (Q2666680): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Da-Chuan Xu / rank
Normal rank
 
Property / author
 
Property / author: Da-Chuan Xu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3934/jimo.2020085 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3022282594 / 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: Q3112637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4806224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149262 / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:37, 27 July 2024

scientific article
Language Label Description Also known as
English
Stochastic-lazier-greedy algorithm for monotone non-submodular maximization
scientific article

    Statements

    Stochastic-lazier-greedy algorithm for monotone non-submodular maximization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 November 2021
    0 references
    0 references
    set function maximization
    0 references
    cardinality constraint
    0 references
    non-submodular
    0 references
    monotone
    0 references
    greedy algorithm
    0 references
    0 references