Inapproximability of dominating set on power law graphs (Q476891)

From MaRDI portal
Revision as of 09:53, 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
Inapproximability of dominating set on power law graphs
scientific article

    Statements

    title
    Inapproximability of dominating set on power law graphs (English)
    0 references
    author
    Mikael Gast
    0 references
    Mathias Hauptmann
    0 references
    Marek Karpinski
    0 references
    publication date
    2 December 2014
    0 references
    Mathematics Subject Classification ID
    05C69
    0 references
    68Q17
    0 references
    68W25
    0 references
    90C27
    0 references
    zbMATH DE Number
    6375994
    0 references
    zbMATH Keywords
    approximation algorithms
    0 references
    inapproximability
    0 references
    power law graphs
    0 references
    combinatorial optimization
    0 references
    dominating set
    0 references
    OpenAlex ID
    W2964161862
    0 references
    arXiv ID
    1212.3517
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q476891&oldid=35426089"
    Powered by MediaWiki