Approximation algorithms for intersection graphs (Q476425)

From MaRDI portal
Revision as of 09:41, 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
Approximation algorithms for intersection graphs
scientific article

    Statements

    title
    Approximation algorithms for intersection graphs (English)
    0 references
    author
    Frank Kammer
    0 references
    Torsten Tholey
    0 references
    published in
    Algorithmica
    0 references
    publication date
    2 December 2014
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    05C22
    0 references
    05C62
    0 references
    05C69
    0 references
    05C76
    0 references
    68Q17
    0 references
    68W25
    0 references
    zbMATH DE Number
    6375631
    0 references
    zbMATH Keywords
    intersection graphs
    0 references
    parameterized approximation algorithms
    0 references
    graph algorithms
    0 references
    NP-hard problems
    0 references
    OpenAlex ID
    W2081642180
    0 references
    Wikidata QID
    Q56019096
    0 references
    cites work
    Q4459826
    0 references
    Q5708492
    0 references
    Unit disk graphs
    0 references
    Q4503944
    0 references
    Q4093489
    0 references
    Q3328583
    0 references
    Q5710169
    0 references
    Q4161356
    0 references
    Elimination Graphs
    0 references
    Q3002782
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q476425&oldid=35425797"
    Powered by MediaWiki