scientific article; zbMATH DE number 6469148
From MaRDI portal
Publication:5501261
zbMath1317.68280MaRDI QIDQ5501261
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (18)
Rectangle packing with one-dimensional resource augmentation ⋮ A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem ⋮ Maximizing the throughput of parallel jobs on hypercubes ⋮ Two for One: Tight Approximation of 2D Bin Packing ⋮ On-line scheduling mesh jobs with dependencies ⋮ iGreen: green scheduling for peak demand minimization ⋮ Tight approximation algorithms for geometric bin packing with skewed items ⋮ Spectrum Bidding in Wireless Networks and Related ⋮ Online removable square packing ⋮ Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation ⋮ On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems ⋮ Exact algorithms for the two-dimensional guillotine knapsack ⋮ A 3-approximation algorithm for two-dimensional bin packing ⋮ Chips on wafers, or packing rectangles into grids ⋮ An approximation algorithm for sequential rectangle placement ⋮ Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack ⋮ Hardness of approximation for orthogonal rectangle packing and covering problems ⋮ Two Dimensional Knapsack with Unloading Constraints
This page was built for publication:
