Approximation schemes for generalized two-dimensional vector packing with application to data placement
type: Item
instance of: scholarly article
title: Approximation schemes for generalized two-dimensional vector packing with application to data placement
zbMATH Open document ID: 1237.68247
author: Hadas Shachnai
author: Tami Tamir
published in: Journal of Discrete Algorithms
publication date: 2012-05-11T00:00:00Z
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6033164
zbMATH Keywords: vector packing
zbMATH Keywords: class constrained multiple knapsack
zbMATH Keywords: data placement
zbMATH Keywords: approximation schemes
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.jda.2011.07.001
OpenAlex ID: W2043577322
cites work: Scheduling techniques for media-on-demand
cites work: On Multidimensional Packing Problems
cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
cites work: Q4196269
cites work: Tight approximation algorithms for maximum general assignment problems
cites work: Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
cites work: `` Strong '' NP-Completeness Results
cites work: Q3050129
cites work: Design and implementation of scalable continuous media servers
cites work: Q4952620
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Algorithms for non-uniform size data placement on parallel disks
cites work: Q4821303
cites work: Q3320130
cites work: Threshold-based dynamic replication in large-scale video-on-demand systems
cites work: Vector Bin Packing with Multiple-Choice
cites work: Approximate Algorithms for the 0/1 Knapsack Problem
cites work: On two class-constrained versions of the multiple knapsack problem
cites work: Polynomial time approximation schemes for class-constrained packing problems
cites work: Q3140449
cites work: There is no asymptotic PTAS for two-dimensional vector packing
DOI: 10.1016/J.JDA.2011.07.001
Recommended article: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Recommended article: An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
Recommended article: Q5501258
Recommended article: Approximation schemes for ordered vector packing problems
Recommended article: Q4780784
Recommended article: Lower bounds and algorithms for the 2-dimensional vector packing problem
Recommended article: An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs
Recommended article: A branch-and-bound algorithm for the two-dimensional vector packing problem
Recommended article: New Approximability Results for 2-Dimensional Packing Problems
Recommended article: Approximation Algorithms for Data Placement Problems
description: scientific article; zbMATH DE number 6033164