Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2011.07.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043577322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling techniques for media-on-demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multidimensional Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4196269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight approximation algorithms for maximum general assignment problems / 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: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and implementation of scalable continuous media servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952620 / 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: Algorithms for non-uniform size data placement on parallel disks / 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: Threshold-based dynamic replication in large-scale video-on-demand systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector Bin Packing with Multiple-Choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Algorithms for the 0/1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two class-constrained versions of the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for class-constrained packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: There is no asymptotic PTAS for two-dimensional vector packing / rank
 
Normal rank

Latest revision as of 05:06, 5 July 2024

scientific article
Language Label Description Also known as
English
Approximation schemes for generalized two-dimensional vector packing with application to data placement
scientific article

    Statements

    Approximation schemes for generalized two-dimensional vector packing with application to data placement (English)
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    vector packing
    0 references
    class constrained multiple knapsack
    0 references
    data placement
    0 references
    approximation schemes
    0 references

    Identifiers