Hardness of lazy packing and covering (Q1015303): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3347319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a dual version of the one-dimensional bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on an open-end bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized on-line open-end bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lazy bureaucrat scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum resource bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lazy Bin Covering and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic fully polynomial approximation schemes for variants of open-end bin packing / rank
 
Normal rank

Latest revision as of 13:55, 1 July 2024

scientific article
Language Label Description Also known as
English
Hardness of lazy packing and covering
scientific article

    Statements