On the absolute approximation ratio for first fit and related results (Q442205): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q2934601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paging and list update under bijective analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight results for next fit and worst fit with resource augmentation / 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: A comparison of performance measures for online algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource constrained scheduling as generalized bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for 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: Q4290987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter bounds of the First Fit algorithm for the bin-packing problem / rank
 
Normal rank

Revision as of 12:43, 5 July 2024

scientific article
Language Label Description Also known as
English
On the absolute approximation ratio for first fit and related results
scientific article

    Statements

    Identifiers