Bounded-space online bin cover (Q1041340): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 05:29, 2 July 2024

scientific article

Language	Label	Description	Also known as
English	Bounded-space online bin cover	scientific article

Statements

scholarly article

0 references

Bounded-space online bin cover (English)

0 references

Journal of Scheduling

0 references

publication date

2 December 2009

0 references

zbMATH Keywords

Markov chains

0 references

Eyjólfur Ingi Ásgeirsson

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10951-009-0116-x

0 references

On a dual version of the one-dimensional bin packing problem

0 references

Markov chains, computer proofs, and average-case analysis of best fit bin packing

0 references

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

0 references

Stability of On-Line Bin Packing with Random Arrivals and Long-Run-Average Constraints

0 references

Online algorithms for a dual version of bin packing

0 references

Probabilistic analysis of algorithms for dual bin packing problems

0 references

On the sum-of-squares algorithm for bin packing

0 references

0 references

Bin packing can be solved within 1+epsilon in linear time

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10951-009-0116-x

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1041340

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1041340&oldid=35140967"