Approximation schemes for generalized two-dimensional vector packing with application to data placement

DOI10.1016/j.jda.2011.07.001zbMath1237.68247OpenAlexW2043577322MaRDI QIDQ414421

Hadas Shachnai, Tami Tamir

Publication date: 11 May 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.07.001

zbMATH Keywords

approximation schemesvector packingclass constrained multiple knapsackdata placement

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (1)

Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows

Uses Software

• Knapsack

Cites Work

• There is no asymptotic PTAS for two-dimensional vector packing
• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
• Scheduling techniques for media-on-demand
• Design and implementation of scalable continuous media servers
• Polynomial time approximation schemes for class-constrained packing problems
• Threshold-based dynamic replication in large-scale video-on-demand systems
• Vector Bin Packing with Multiple-Choice
• Tight approximation algorithms for maximum general assignment problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Approximate Algorithms for the 0/1 Knapsack Problem
• `` Strong NP-Completeness Results
• On Multidimensional Packing Problems
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• Algorithms for non-uniform size data placement on parallel disks
• On two class-constrained versions of the multiple knapsack problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximation schemes for generalized two-dimensional vector packing with application to data placement