Bin packing game with a price of anarchy of \(\frac{3}{2}\) (Q1702843): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Qingqin Nong / rank
 
Normal rank
Property / author
 
Property / author: Cheng, T. C. Edwin / rank
 
Normal rank
Property / author
 
Property / author: Qizhi Fang / 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/s10878-017-0201-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2767440689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9 / 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: Q2957914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin Packing Games with Selfish Items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric packing of selfish items and the subset sum algorithm / 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: A note on a selfish bin packing problem / rank
 
Normal rank

Latest revision as of 06:47, 15 July 2024

scientific article
Language Label Description Also known as
English
Bin packing game with a price of anarchy of \(\frac{3}{2}\)
scientific article

    Statements