Exponential approximation schemata for some network design problems (Q396669)

From MaRDI portal
Revision as of 16:20, 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
Exponential approximation schemata for some network design problems
scientific article

    Statements

    title
    Exponential approximation schemata for some network design problems (English)
    0 references
    author
    Nicolas Boria
    0 references
    Nicolas Bourgeois
    0 references
    Bruno Escoffier
    0 references
    Vangelis Th. Paschos
    0 references
    publication date
    13 August 2014
    0 references
    zbMATH Keywords
    exponential algorithms
    0 references
    approximation algorithms
    0 references
    Steiner tree
    0 references
    traveling salesman problem
    0 references
    cites work

    Identifiers

    Mathematics Subject Classification ID
    68W25
    0 references
    68Q25
    0 references
    90B10
    0 references
    90C27
    0 references
    90C35
    0 references
    zbMATH DE Number
    6329907
    0 references
    OpenAlex ID
    W2079928809
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q396669&oldid=38331898"
    Powered by MediaWiki