Online algorithms with advice for the dual bin packing problem (Q1642809): 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/s10100-016-0450-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2481908560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reordering Buffer Management with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online makespan minimization with parallel schedules / 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: Fair versus unrestricted bin packing / 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: Semi on-line algorithms for the partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bin packing with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Accommodating Function: A Generalization of the Competitive Ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing: Maximizing the number of pieces packed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online knapsack revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of Buffer Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online computation with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4439453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Stochastic Matching: Beating 1-1/e / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bipartite matching with random arrivals / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:12, 15 July 2024

scientific article
Language Label Description Also known as
English
Online algorithms with advice for the dual bin packing problem
scientific article

    Statements

    Online algorithms with advice for the dual bin packing problem (English)
    0 references
    0 references
    15 June 2018
    0 references
    online algorithms
    0 references
    online computation with advice
    0 references
    competitive analysis
    0 references
    dual bin packing
    0 references
    multiple knapsack problem
    0 references

    Identifiers