A note on a selfish bin packing problem (Q2393075): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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/s10898-012-9856-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009126961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing / 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: 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: Next-fit packs a list and its reverse into the same number of bins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133108 / 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: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of selfish routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank

Latest revision as of 18:13, 6 July 2024

scientific article
Language Label Description Also known as
English
A note on a selfish bin packing problem
scientific article

    Statements