A new lower bound on the price of anarchy of selfish bin packing (Q2274500): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2019.06.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2951304930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish bin packing with cardinality constraints / 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: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a selfish bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing game with a price of anarchy of \(\frac{3}{2}\) / rank
 
Normal rank

Latest revision as of 11:56, 20 July 2024

scientific article
Language Label Description Also known as
English
A new lower bound on the price of anarchy of selfish bin packing
scientific article

    Statements

    A new lower bound on the price of anarchy of selfish bin packing (English)
    0 references
    0 references
    0 references
    20 September 2019
    0 references
    combinatorial problems
    0 references
    bin packing
    0 references
    price of anarchy
    0 references

    Identifiers