PTAS for densest \(k\)-subgraph in interval graphs (Q261389)

From MaRDI portal
Revision as of 12:48, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
PTAS for densest \(k\)-subgraph in interval graphs
scientific article

    Statements

    title
    PTAS for densest \(k\)-subgraph in interval graphs (English)
    0 references
    author
    Tim Nonner
    0 references
    published in
    Algorithmica
    0 references
    publication date
    23 March 2016
    0 references
    zbMATH Keywords
    approximation algorithms
    0 references
    graph algorithms
    0 references
    approximation schemes
    0 references
    interval graphs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W25
    0 references
    05C62
    0 references
    05C85
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6559791
    0 references
    OpenAlex ID
    W2161076233
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q261389&oldid=38284322"
    Powered by MediaWiki