Approximating Min-Max (Regret) Versions of Some Polynomial Problems (Q3591305)

From MaRDI portal
Revision as of 21:15, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
scientific article

    Statements

    title
    Approximating Min-Max (Regret) Versions of Some Polynomial Problems (English)
    0 references
    DOI
    10.1007/11809678_45
    0 references
    author
    Hassene Aissi
    0 references
    Daniel Vanderpooten
    0 references
    Cristina Bazgan
    0 references
    publication date
    10 September 2007
    0 references
    Mathematics Subject Classification ID
    90C27
    0 references
    68W25
    0 references
    90C59
    0 references
    90C60
    0 references
    zbMATH DE Number
    5189487
    0 references
    zbMATH Keywords
    min-max
    0 references
    min-max regret
    0 references
    approximation
    0 references
    fptas
    0 references
    shortest path
    0 references
    minimum spanning tree
    0 references
    OpenAlex ID
    W2124833419
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3591305&oldid=31716078"
    Powered by MediaWiki