Pith. sign in

REVIEW 1 cited by

A new lower bound for classic online bin packing

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1807.05554 v1 pith:BHKJUEGR submitted 2018-07-15 cs.DS cs.DMmath.COmath.OC

János Balogh , József Békési , György Dósa , Leah Epstein , Asaf Levin This is my paper · ORCID
classification cs.DScs.DMmath.COmath.OC
keywords lowerboundsonlinepackingboundclassicaboveadaptivity
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packing to above 1.54278. We demonstrate for the first time the advantage of branching and the applicability of full adaptivity in the design of lower bounds for the classic online bin packing problem. We apply a new method for weight based analysis, which is usually applied only in proofs of upper bounds. The values of previous lower bounds were approximately 1.5401 and 1.5403.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On bin packing with clustering and bin packing with delays

    cs.DS 2019-08 conditional novelty 6.0 of 10

    The price of clustering for bin packing with cluster cost at least 3 is bounded between 1.93558 and 1.93667, and the competitive ratio for online bin packing with delays is improved to below 3.1551.

Pith tools