Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jda.2013.06.006 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2013.06.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2105591103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pipage rounding: a new method of constructing algorithms with proven performance guarantee / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maximum edge weight clique problem via unconstrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the bi-criteria weighted MAX-CUT problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of a class of combinatorial optimization problems with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing an efficient fptas for the 0-1 multi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-coloring of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Multiobjective Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation of max-vertex-cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian relaxation approach to the edge-weighted clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of maximum splitting of k-sets and some other Apx-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-monotone submodular maximization under matroid and knapsack constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating multicriteria TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of schedules that are near-optimal for both makespan and total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications / 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: A polynomial-time approximation scheme for maximizing the minimum machine completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximations for max set splitting and max NAE SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250183 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JDA.2013.06.006 / rank
 
Normal rank

Latest revision as of 16:20, 9 December 2024

scientific article
Language Label Description Also known as
English
Approximation with a fixed number of solutions of some multiobjective maximization problems
scientific article

    Statements

    Approximation with a fixed number of solutions of some multiobjective maximization problems (English)
    0 references
    0 references
    0 references
    0 references
    13 August 2014
    0 references
    multiobjective maximization problems
    0 references
    approximation
    0 references
    submodular functions
    0 references
    bisection
    0 references
    matching
    0 references
    coverage
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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