Pages that link to "Item:Q293152"

The following pages link to There is no asymptotic PTAS for two-dimensional vector packing (Q293152):

Displaying 23 items.

• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem (Q297181) (← links)
• Vector bin packing with heterogeneous bins: application to the machine reassignment problem (Q338869) (← links)
• Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
• Structure of polynomial-time approximation (Q692893) (← links)
• Bin packing with controllable item sizes (Q1004389) (← links)
• Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242) (← links)
• Colocating tasks in data centers using a side-effects performance model (Q1754339) (← links)
• An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing (Q1870001) (← links)
• Truthful mechanism design for bin packing with applications on cloud computing (Q2084605) (← links)
• A branch-and-price algorithm for the two-dimensional vector packing problem (Q2329474) (← links)
• A two-dimensional vector packing model for the efficient use of coil cassettes (Q2387252) (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• Bin covering with cardinality constraints (Q2446840) (← links)
• An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs (Q2670556) (← links)
• Set Covering with Ordered Replacement: Additive and Multiplicative Gaps (Q3009761) (← links)
• A 4/3-APPROXIMATION ALGORITHM FOR CASSETTE PACKING IN STEEL INDUSTRY (Q3503009) (← links)
• (Q5089171) (← links)
• (Q5091067) (← links)
• Streaming algorithms for bin packing and vector scheduling (Q5919096) (← links)
• Lower bounds and algorithms for the 2-dimensional vector packing problem (Q5939229) (← links)
• On data reduction for dynamic vector bin packing (Q6047700) (← links)
• There is no APTAS for 2-dimensional vector bin packing: revisited (Q6072215) (← links)
• A 4/3 OPT+2/3 approximation for big two-bar charts packing problem (Q6147752) (← links)