A general approximation method for bicriteria minimization problems (Q2402670): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficiently computing succinct trade-off curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability and Hardness in Multi-objective Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Pareto sets of minimal size for multi-objective optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Network Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved FPTAS for Restricted Shortest Path. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple efficient approximation scheme for the restricted shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving an epsilon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-approximation algorithm for the minimum weight edge dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved LP-based approximation for steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max flows in O(nm) time, or better / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Deterministic Maximum Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster parametric shortest path and minimum‐balance algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129922 / rank
 
Normal rank

Latest revision as of 10:12, 14 July 2024

scientific article
Language Label Description Also known as
English
A general approximation method for bicriteria minimization problems
scientific article

    Statements

    A general approximation method for bicriteria minimization problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 September 2017
    0 references
    multicriteria optimization
    0 references
    bicriteria approximation algorithm
    0 references
    approximate Pareto curve
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references