Parameterized complexity of \(k\)-Chinese postman problem (Q391983)

From MaRDI portal
Revision as of 14:15, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parameterized complexity of \(k\)-Chinese postman problem
scientific article

    Statements

    title
    Parameterized complexity of \(k\)-Chinese postman problem (English)
    0 references
    author
    Gregory Gutin
    0 references
    Gabriele Muciaccia
    0 references
    Anders Yeo
    0 references
    publication date
    13 January 2014
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C45
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6244609
    0 references
    zbMATH Keywords
    fixed-parameter tractability
    0 references
    polynomial kernels
    0 references
    Chinese postman problem
    0 references
    OpenAlex ID
    W1984595263
    0 references
    arXiv ID
    1308.0482
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q391983&oldid=33307123"
    Powered by MediaWiki