Online bin covering: expectations vs. guarantees (Q300236): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Lene Monrad Favrholdt / rank
Normal rank
 
Property / author
 
Property / author: Kim S. Larsen / rank
Normal rank
 
Property / author
 
Property / author: Lene Monrad Favrholdt / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2129253870 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1309.6477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558293 / 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: A new measure for the study of on-line algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative worst order ratio for online algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative worst-order ratio applied to paging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative Interval Analysis of Paging Algorithms on Access Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of performance measures for online algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of performance measures via online search / 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: Online algorithms for a dual version of bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: List factoring and relative worst order analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing online algorithms for bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random-order bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875207 / 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: On-line bin packing in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the online bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Space for Bounded-Space, On-Line Bin-Packing / rank
 
Normal rank

Latest revision as of 06:25, 12 July 2024

scientific article
Language Label Description Also known as
English
Online bin covering: expectations vs. guarantees
scientific article

    Statements

    Online bin covering: expectations vs. guarantees (English)
    0 references
    0 references
    0 references
    0 references
    27 June 2016
    0 references
    0 references
    online algorithms
    0 references
    bin covering
    0 references
    performance measures
    0 references
    competitive analysis
    0 references
    0 references
    0 references