Pages that link to "Item:Q1164429"
From MaRDI portal
The following pages link to Bin packing can be solved within 1+epsilon in linear time (Q1164429):
Displaying 50 items.
- New approximability results for two-dimensional bin packing (Q261358) (← links)
- Online bin packing with advice (Q261387) (← links)
- An improved two-machine flowshop scheduling with intermediate transportation (Q266074) (← links)
- Vertex cover meets scheduling (Q270025) (← links)
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129) (← links)
- There is no asymptotic PTAS for two-dimensional vector packing (Q293152) (← links)
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem (Q297181) (← links)
- New approximation algorithms for the unsplittable capacitated facility location problem (Q300454) (← links)
- Semi-on-line bin packing: a short overview and a new lower bound (Q301113) (← links)
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (Q341463) (← links)
- Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← links)
- Vector bin packing with multiple-choice (Q427903) (← links)
- An approximation scheme for the two-stage, two-dimensional knapsack problem (Q429647) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Online algorithms with advice for bin packing and scheduling problems (Q496020) (← links)
- An improved approximation scheme for variable-sized bin packing (Q504994) (← links)
- Resource allocation algorithms for virtualized service hosting platforms (Q666218) (← links)
- A fundamental restriction on fully dynamic maintenance of bin packing (Q671611) (← links)
- On approximating the longest path in a graph (Q679451) (← links)
- An approximation algorithm for square packing. (Q703277) (← links)
- Min-sum bin packing (Q721936) (← links)
- Approximation schemes for knapsack problems with shelf divisions (Q818116) (← links)
- An APTAS for bin packing with clique-graph conflicts (Q832868) (← links)
- Rectangle packing with one-dimensional resource augmentation (Q834190) (← links)
- Strip packing with precedence constraints and strip packing with release times (Q837172) (← links)
- Bin packing with rejection revisited (Q848845) (← links)
- On relocation problems with multiple identical working crews (Q865754) (← links)
- A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) (← links)
- An asymptotic competitive scheme for online bin packing (Q896124) (← links)
- Approximation schemes for packing with item fragmentation (Q927410) (← links)
- An asymptotic approximation scheme for the concave cost bin packing problem (Q933537) (← links)
- \(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems (Q951128) (← links)
- Asymptotic fully polynomial approximation schemes for variants of open-end bin packing (Q975519) (← links)
- Class constrained bin packing revisited (Q986543) (← links)
- Bin packing with controllable item sizes (Q1004389) (← links)
- A robust APTAS for the classical bin packing problem (Q1013966) (← links)
- An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (Q1016040) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- Three-dimensional packings with rotations (Q1017455) (← links)
- Variable sized online interval coloring with bandwidth (Q1024785) (← links)
- Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242) (← links)
- A sublinear-time approximation scheme for bin packing (Q1034628) (← links)
- Approximation algorithms for orthogonal packing problems for hypercubes (Q1035685) (← links)
- On lazy bin covering and packing problems (Q1041247) (← links)
- Bounded-space online bin cover (Q1041340) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- A linear time bin-packing algorithm (Q1062626) (← links)
- A 71/60 theorem for bin packing (Q1083194) (← links)
