Online bin packing with advice of small size (Q2322702): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q129986891, #quickstatements; #temporary_batch_1729546961733
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Adi Rosén / rank
Normal rank
 
Property / author
 
Property / author: Adi Rosén / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OEIS / 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/s00224-018-9862-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2797367353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reordering Buffer Management with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Bin Packing with Advice of Small Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4793088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for certain classes of bin packing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Minimum Spanning Tree with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: The online knapsack problem: advice and randomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The string guessing problem as a method to prove lower bounds on the advice complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of the k-Server Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of Online Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted Online Problems with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the list update problem with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bin packing with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Much Information about the Future Is Needed? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the problem-relevant information in input / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online computation with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bin Packing with Conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repacking helps in bounded space on-line bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Relaxed Online Bin-Packing Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and design of algorithms in combinatorial optimization. (School held in Udine in September 1979) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the advice complexity of the \(k\)-server problem under sparse metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beating the Harmonic Lower Bound for Online Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice Complexity and Barely Random Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On online algorithms with advice for the \(k\)-server problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms with advice for bin packing and scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4443440 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129986891 / rank
 
Normal rank

Latest revision as of 22:51, 21 October 2024

scientific article
Language Label Description Also known as
English
Online bin packing with advice of small size
scientific article

    Statements

    Online bin packing with advice of small size (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 September 2019
    0 references
    online bin packing
    0 references
    competitive analysis
    0 references
    advice complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers