scientific article; zbMATH DE number 3997164

zbMATH Open0615.68035MaRDI QIDQ4723300

A. Inványi

Publication date: 1986

Title of this publication is not available (Why is that?)

zbMATH Keywords

approximate algorithmsone-dimensional bin packing

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial aspects of packing and covering (05B40)

Related Items (7)

Complexity of core allocation for the bin packing game ⋮ A-shaped bin packing: Worst case analysis via simulation ⋮ Tight approximations for resource constrained scheduling and bin packing ⋮ Bin packing with ``largest in bottom constraint: tighter bounds and generalizations ⋮ Tight approximation algorithms for geometric bin packing with skewed items ⋮ Improved bounds for harmonic-based bin packing algorithms ⋮ Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Bin packing with ``largest in bottom constraint: tighter bounds and generalizations 👍 👎
• New lower bounds for certain classes of bin packing algorithms 👍 👎
• Tighter bounds of the First Fit algorithm for the bin-packing problem 👍 👎
• A tight lower bound for optimal bin packing 👍 👎
• Computing the asymptotic worst-case of bin packing lower bounds 👍 👎
• Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms 👍 👎
• New Lower Bounds for Certain Classes of Bin Packing Algorithms 👍 👎
• Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4723300)