Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty (Q2922614)

From MaRDI portal
Revision as of 23:28, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty
scientific article

    Statements

    title
    Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty (English)
    0 references
    publication date
    14 October 2014
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W27
    0 references
    05B35
    0 references
    05C05
    0 references
    68Q10
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6355320
    0 references
    OpenAlex ID
    W232024102
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2922614&oldid=32391115"
    Powered by MediaWiki