Average case analysis of bounded space bin packing algorithms (Q2471807): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/s00453-007-9073-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004367594 / 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: Stochastic analysis of a slotted FIFO communication channel / 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 II: Tight bounds on First Fit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stochastic model of bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for stability of a bin-packing system / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic analysis of the next fit decreasing bin packing heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded space on-line bin packing: Best is better than first / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stochastic analysis of the NFD bin-packing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple on-line bin-packing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best \(k\)-fit bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case analysis of the smart next fit algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of the next fit decreasing algorithm for bin- packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Martingale Inequalities and NP-Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Bin Packing with Items of Random Sizes II / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:14, 27 June 2024

scientific article
Language Label Description Also known as
English
Average case analysis of bounded space bin packing algorithms
scientific article

    Statements

    Average case analysis of bounded space bin packing algorithms (English)
    0 references
    0 references
    0 references
    0 references
    18 February 2008
    0 references
    Bin packing
    0 references
    Average case analysis
    0 references
    Algorithms
    0 references
    Discrete item size distribution
    0 references
    Bounded space
    0 references

    Identifiers