The Optimal Absolute Ratio for Online Bin Packing

Journal of Computer and System Sciences - United States
doi 10.1016/j.jcss.2018.11.005
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
2002English

Online Bin Packing With Resource Augmentation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Online Bin Packing With Cardinality Constraints

SIAM Journal on Discrete Mathematics
Mathematics
2006English

Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Bin Packing With Queues

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
2008English

Modified Strip Packing Heuristics for the Rectangular Variable-Sized Bin Packing Problem

ORiON
2010English

Bin Packing With Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings

SIAM Journal on Discrete Mathematics
Mathematics
2000English

Probabilistic Analysis of Algorithms for Dual Bin Packing Problems

Journal of Algorithms
1991English

Partitioning Bin-Packing Algorithms for Distributed Real-Time Systems

International Journal of Embedded Systems
HardwareArchitectureSoftware
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy