"Truly Asymptotic Lower Bounds for Online Vector Bin Packing."

János Balogh et al. (2021)

> Home

Details and statistics

DOI: 10.4230/LIPICS.APPROX/RANDOM.2021.8

access: open

type: Conference or Workshop Paper

metadata version: 2021-09-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/approx/BaloghCEL21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/BaloghCEL21
János Balogh, Ilan Reuven Cohen, Leah Epstein, Asaf Levin:
Truly Asymptotic Lower Bounds for Online Vector Bin Packing. APPROX-RANDOM 2021: 8:1-8:18

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.