General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of min-max and min-max regret versions of some combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for the Restricted Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for a class of subset selection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of distinct representatives and linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The combinatorial approach yields an NC algorithm for computing Pfaffians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Multiobjective Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact arborescences, matchings and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank

Latest revision as of 09:37, 5 July 2024

scientific article
Language Label Description Also known as
English
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
scientific article

    Statements

    General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (English)
    0 references
    0 references
    0 references
    0 references
    20 June 2012
    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
    knapsack
    0 references
    minimum weighted perfect matching
    0 references
    0 references