Truly Asymptotic Lower Bounds for Online Vector Bin Packing | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

Truly Asymptotic Lower Bounds for Online Vector Bin Packing

Identifier:nobleid.org/w1/20260515/FE455BFE

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/FE455BFE.svg?ark=w1%2F20260515%2FFE455BFE)](https://nobleid.org/work/w1/20260515/FE455BFE)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Ilan Reuven Cohen

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy