There is no EPTAS for two-dimensional knapsack (Q765522): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2010.05.031 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.031 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067088693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for knapsack problems with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear FPT reductions and computational lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633878 / 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: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Approximation Schemes for Multidimensional Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ipl/KulikS10 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2010.05.031 / rank
 
Normal rank

Latest revision as of 03:10, 10 December 2024

scientific article
Language Label Description Also known as
English
There is no EPTAS for two-dimensional knapsack
scientific article

    Statements

    There is no EPTAS for two-dimensional knapsack (English)
    0 references
    0 references
    0 references
    19 March 2012
    0 references
    two-dimensional knapsack
    0 references
    efficient polynomial-time approximation schemes
    0 references
    parameterized complexity
    0 references
    theory of computation
    0 references

    Identifiers