Sparsest cut on bounded treewidth graphs (Q5495798)

From MaRDI portal
Revision as of 02:32, 20 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6326962
Language Label Description Also known as
English
Sparsest cut on bounded treewidth graphs
scientific article; zbMATH DE number 6326962

    Statements

    title
    Sparsest cut on bounded treewidth graphs (English)
    0 references
    author
    Anupam Gupta
    0 references
    Kunal Talwar
    0 references
    David Witmer
    0 references
    publication date
    7 August 2014
    0 references
    zbMATH Keywords
    APX-hardness
    0 references
    graph separators
    0 references
    Sherali-Adams
    0 references
    sparsest cut
    0 references
    treewidth
    0 references
    unique games
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C05
    0 references
    05C51
    0 references
    68Q17
    0 references
    68Q25
    0 references
    68W25
    0 references
    90C05
    0 references
    zbMATH DE Number
    6326962
    0 references
    OpenAlex ID
    W2115163112
    0 references
    arXiv ID
    1305.1347
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5495798&oldid=33764205"
    Powered by MediaWiki