An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q61638376, #quickstatements; #temporary_batch_1706974296281
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3892056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Approximation Algorithm For The Subset-Sum Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new fully polynomial time approximation scheme for the Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved dynamic programming in connection with an FPTAS for the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation algorithm for the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of greedy algorithms for the subset-sum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for the subset-sum problem: Survey and experimental analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Knapsack Problems with Bounded Weights / rank
 
Normal rank

Latest revision as of 08:37, 6 June 2024

scientific article
Language Label Description Also known as
English
An efficient fully polynomial approximation scheme for the Subset-Sum problem.
scientific article

    Statements

    An efficient fully polynomial approximation scheme for the Subset-Sum problem. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 August 2003
    0 references
    Subset-sum problem
    0 references
    Worst-case performance
    0 references
    Fully polynomial approximation scheme
    0 references
    Knapsack problem
    0 references

    Identifiers