Approximating Min-Max (Regret) Versions of Some Polynomial Problems (Q3591305): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2124833419 / rank
 
Normal rank

Latest revision as of 21:15, 19 March 2024

scientific article
Language Label Description Also known as
English
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
scientific article

    Statements

    Approximating Min-Max (Regret) Versions of Some Polynomial Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 September 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    min-max
    0 references
    min-max regret
    0 references
    approximation
    0 references
    fptas
    0 references
    shortest path
    0 references
    minimum spanning tree
    0 references
    0 references