Ranking with submodular functions on a budget (Q2147409): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MovieLens / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4224692229 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2204.04168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple intents re-ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Diversified Search Ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/jmlr.2003.3.4-5.993 / 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: Approximating min sum set cover / 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: 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

Latest revision as of 08:53, 29 July 2024

scientific article
Language Label Description Also known as
English
Ranking with submodular functions on a budget
scientific article

    Statements

    Ranking with submodular functions on a budget (English)
    0 references
    0 references
    0 references
    0 references
    20 June 2022
    0 references
    ranking
    0 references
    submodular maximization
    0 references
    dynamic programming
    0 references
    approximation algorithms
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references