Pages that link to "Item:Q4575690"

The following pages link to Improved Approximation for Vector Bin Packing (Q4575690):

Displaying 21 items.

• There is no asymptotic PTAS for two-dimensional vector packing (Q293152) (← links)
• Vector bin packing with multiple-choice (Q427903) (← links)
• Approximating vector scheduling: almost matching upper and lower bounds (Q727975) (← links)
• Improved bounds for harmonic-based bin packing algorithms (Q1182320) (← links)
• Two-bar charts packing problem (Q2047190) (← links)
• Truthful mechanism design for bin packing with applications on cloud computing (Q2084605) (← links)
• Sequential vector packing (Q2378514) (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• Approximation algorithms for a virtual machine allocation problem with finite types (Q2680235) (← links)
• Approximation schemes for ordered vector packing problems (Q4456057) (← links)
• A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem (Q5054168) (← links)
• (Q5089171) (← links)
• Tight bounds for online vector bin packing (Q5495868) (← links)
• Streaming algorithms for bin packing and vector scheduling (Q5919096) (← links)
• On data reduction for dynamic vector bin packing (Q6047700) (← links)
• Tight approximation algorithms for geometric bin packing with skewed items (Q6053472) (← links)
• There is no APTAS for 2-dimensional vector bin packing: revisited (Q6072215) (← links)
• A Tight (3/2+ε) Approximation for Skewed Strip Packing. (Q6084400) (← links)
• On Guillotine Separability of Squares and Rectangles. (Q6084407) (← links)
• An improved approximation for packing big two-bar charts (Q6187994) (← links)
• The preemptive resource allocation problem (Q6547132) (← links)