On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6362568 / rank
 
Normal rank
Property / zbMATH Keywords
 
reoptimization
Property / zbMATH Keywords: reoptimization / rank
 
Normal rank
Property / zbMATH Keywords
 
\(r\)-approximation algorithm
Property / zbMATH Keywords: \(r\)-approximation algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial-time approximation scheme
Property / zbMATH Keywords: polynomial-time approximation scheme / rank
 
Normal rank

Revision as of 13:44, 30 June 2023

scientific article
Language Label Description Also known as
English
On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems
scientific article

    Statements

    On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (English)
    0 references
    30 October 2014
    0 references
    reoptimization
    0 references
    \(r\)-approximation algorithm
    0 references
    polynomial-time approximation scheme
    0 references

    Identifiers