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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10951-009-0116-x / rank
Normal rank
 
Property / author
 
Property / author: Eyjólfur Ingi Ásgeirsson / rank
Normal rank
 
Property / author
 
Property / author: Clifford Stein / rank
Normal rank
 
Property / author
 
Property / author: Eyjólfur Ingi Ásgeirsson / rank
 
Normal rank
Property / author
 
Property / author: Clifford Stein / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-009-0116-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2118750144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a dual version of the one-dimensional bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov chains, computer proofs, and average-case analysis of best fit bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of On-Line Bin Packing with Random Arrivals and Long-Run-Average Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms for a dual version of bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of algorithms for dual bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sum-of-squares algorithm for bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing can be solved within 1+epsilon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4507776 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10951-009-0116-X / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:31, 10 December 2024

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

    Statements

    Identifiers