Pages that link to "Item:Q4732116"
From MaRDI portal
The following pages link to On-line bin packing in linear time (Q4732116):
Displaying 50 items.
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129) (← links)
- Online bin covering: expectations vs. guarantees (Q300236) (← links)
- Semi-on-line bin packing: a short overview and a new lower bound (Q301113) (← links)
- Online bin packing problem with buffer and bounded size revisited (Q511697) (← links)
- A note on online hypercube packing (Q623793) (← links)
- A fundamental restriction on fully dynamic maintenance of bin packing (Q671611) (← links)
- An on-line algorithm for multidimensional bin packing (Q688930) (← links)
- Bin packing with rejection revisited (Q848845) (← links)
- An asymptotic competitive scheme for online bin packing (Q896124) (← links)
- More on online bin packing with two item sizes (Q955329) (← links)
- Resource augmented semi-online bounded space bin packing (Q967321) (← links)
- Two-dimensional online bin packing with rotation (Q982663) (← links)
- Class constrained bin packing revisited (Q986543) (← links)
- Bin packing with controllable item sizes (Q1004389) (← links)
- Online variable-sized bin packing (Q1111472) (← links)
- Average-case analysis of the smart next fit algorithm (Q1120280) (← links)
- Multidimensional on-line bin packing: Algorithms and worst-case analysis (Q1123131) (← links)
- Improved bounds for harmonic-based bin packing algorithms (Q1182320) (← links)
- Does randomization help in on-line bin packing? (Q1198004) (← links)
- An improved lower bound for on-line bin packing algorithms (Q1199958) (← links)
- Packings in two dimensions: Asymptotic average-case analysis of algorithms (Q1209735) (← links)
- Linear time-approximation algorithms for bin packing (Q1591548) (← links)
- The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints (Q1635504) (← links)
- The optimal absolute ratio for online bin packing (Q1741486) (← links)
- Average-case analysis of the modified harmonic algorithm (Q1825655) (← links)
- Assigning service requests in voice-over-internet gateway multiprocessors (Q1886507) (← links)
- A 5/4 linear time bin packing algorithm (Q1975969) (← links)
- Best fit bin packing with random order revisited (Q1979457) (← links)
- A new upper bound for the online square packing problem in a strip (Q2012894) (← links)
- More on ordered open end bin packing (Q2066681) (← links)
- Open-end bin packing: new and old analysis approaches (Q2172402) (← links)
- Online bin packing with cardinality constraints resolved (Q2186811) (← links)
- Efficient 1-space bounded hypercube packing algorithm (Q2205633) (← links)
- Competitive clustering of stochastic communication patterns on a ring (Q2218479) (← links)
- Improved lower bounds for the online bin packing problem with cardinality constraints (Q2354295) (← links)
- NF-based algorithms for online bin packing with buffer and bounded item size (Q2355990) (← links)
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing (Q2392739) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Drawer algorithms for 1-space bounded multidimensional hyperbox packing (Q2424663) (← links)
- Online bin packing with resource augmentation (Q2427692) (← links)
- On-line bin packing with restricted repacking (Q2436663) (← links)
- Online square and cube packing (Q2570973) (← links)
- Approximate strip packing: revisited (Q2629852) (← links)
- Bounds for online bin packing with cardinality constraints (Q2629856) (← links)
- A note on a variant of the online open end bin packing problem (Q2661578) (← links)
- NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation (Q2867105) (← links)
- Online Bin Covering: Expectations vs. Guarantees (Q2867122) (← links)
- Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing (Q3004684) (← links)
- ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING (Q3069730) (← links)
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps (Q4210166) (← links)
