"A Simple Proof of Liang's Lower Bound for On-Line bin Packing and the ..."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Gábor Galambos, J. B. G. Frenk (1993)

> Home

Details and statistics

DOI: 10.1016/0166-218X(93)90037-O

access: open

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/GalambosF93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/GalambosF93
Gábor Galambos, J. B. G. Frenk:
A Simple Proof of Liang's Lower Bound for On-Line bin Packing and the Extension to the Parametric Case. Discret. Appl. Math. 41(2): 173-178 (1993)

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.