The Densest $k$-Subhypergraph Problem (Q3174693)

From MaRDI portal
Revision as of 10:30, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Densest $k$-Subhypergraph Problem
scientific article

    Statements

    title
    The Densest $k$-Subhypergraph Problem (English)
    0 references
    author
    Eden Chlamtáč
    0 references
    Michael Dinitz
    0 references
    Christian Konrad
    0 references
    George Rabanca
    0 references
    Guy Kortsarz
    0 references
    publication date
    18 July 2018
    0 references
    zbMATH Keywords
    denseness
    0 references
    hypergraph
    0 references
    approximation
    0 references

    Identifiers

    DOI
    10.1137/16M1096402
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C65
    0 references
    68W25
    0 references
    zbMATH DE Number
    6904888
    0 references
    OpenAlex ID
    W2963725737
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3174693&oldid=37089035"
    Powered by MediaWiki