Restricted parameter range promise set cover problems are easy (Q2258109)

From MaRDI portal
Revision as of 19:13, 9 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
Restricted parameter range promise set cover problems are easy
scientific article

    Statements

    title
    Restricted parameter range promise set cover problems are easy (English)
    0 references
    author
    Hao Chen
    0 references
    publication date
    2 March 2015
    0 references
    zbMATH DE Number
    6410256
    0 references
    zbMATH Keywords
    set cover problem
    0 references
    lattice
    0 references
    closest vector problem (CVP)
    0 references
    shortest vector problem (SVP)
    0 references
    OpenAlex ID
    W2103937176
    0 references
    arXiv ID
    1110.1896
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2258109&oldid=35441695"
    Powered by MediaWiki