Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem (Q2099386)

From MaRDI portal
Revision as of 23:01, 30 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
scientific article

    Statements

    title
    Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem (English)
    0 references
    author
    Majun Shi
    0 references
    Zishen Yang
    0 references
    Wei Wang
    0 references
    publication date
    23 November 2022
    0 references
    zbMATH DE Number
    7622516
    0 references
    zbMATH Keywords
    greedy algorithm
    0 references
    performance ratio
    0 references
    submodular function
    0 references
    submodular cover
    0 references
    OpenAlex ID
    W4309326516
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2099386&oldid=37463784"
    Powered by MediaWiki