Pages that link to "Item:Q1164429"

The following pages link to Bin packing can be solved within 1+epsilon in linear time (Q1164429):

Displayed 50 items.

• 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)
• Approximation schemes for knapsack problems with shelf divisions (Q818116) ‎ (← 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)
• 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)
• 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)
• Bin packing as a random walk: A note on Knödel's paper (Q1084021) ‎ (← links)
• The average-case analysis of some on-line algorithms for bin packing (Q1100912) ‎ (← links)
• Parallel approximation algorithms for bin packing (Q1123807) ‎ (← links)
• A polynomial algorithm for an integer quadratic non-separable transportation problem (Q1198737) ‎ (← links)
• Differential approximation algorithms for some combinatorial optimization problems (Q1274917) ‎ (← links)
• Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) ‎ (← links)
• On dependent randomized rounding algorithms (Q1306458) ‎ (← links)
• Multiple-type, two-dimensional bin packing problems: Applications and algorithms (Q1339128) ‎ (← links)
• Polynomial time approximation schemes for class-constrained packing problems (Q1348737) ‎ (← links)
• A polynomial-time approximation scheme for maximizing the minimum machine completion time (Q1362519) ‎ (← links)
• Tight approximations for resource constrained scheduling and bin packing (Q1372745) ‎ (← links)
• Edge disjoint Polyp Packing (Q1377661) ‎ (← links)
• An approximation scheme for strip packing of rectangles with bounded dimensions (Q1383370) ‎ (← links)
• An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension (Q1391539) ‎ (← links)
• Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) ‎ (← links)
• Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) ‎ (← links)
• Linear time-approximation algorithms for bin packing (Q1591548) ‎ (← links)
• A PTAS for the multiple subset sum problem with different knapsack capacities (Q1607031) ‎ (← links)
• Multidimensional cube packing (Q1762987) ‎ (← links)
• The two-dimensional cutting stock problem revisited (Q1774168) ‎ (← links)
• A linear time algorithm for restricted bin packing and scheduling problems (Q1837623) ‎ (← links)
• Two-dimensional packing problems: a survey (Q1847188) ‎ (← links)
• An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing (Q1870001) ‎ (← links)
• Bridging gap between standard and differential polynomial approximation: The case of bin-packing (Q1961735) ‎ (← links)
• Approximability of scheduling with fixed jobs (Q1964484) ‎ (← links)