Pages that link to "Item:Q3586179"

The following pages link to A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing (Q3586179):

Displaying 21 items.

• New approximability results for two-dimensional bin packing (Q261358) (← links)
• Packing anchored rectangles (Q276437) (← links)
• Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
• A \((5/3+\varepsilon)\)-approximation for strip packing (Q390133) (← links)
• Online square-into-square packing (Q521815) (← links)
• The minimum feasible tileset problem (Q666670) (← links)
• A set covering based approach to find the reduct of variable precision rough set (Q726549) (← links)
• Two-dimensional online bin packing with rotation (Q982663) (← links)
• Approximation algorithms for orthogonal packing problems for hypercubes (Q1035685) (← links)
• Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints (Q2018944) (← links)
• An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
• Choosing among heterogeneous server clouds (Q2360877) (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• Bin packing with general cost structures (Q2429476) (← links)
• Fractional Set Cover in the Streaming Model. (Q5002615) (← links)
• A Service System with Packing Constraints: Greedy Randomized Algorithm Achieving Sublinear in Scale Optimality Gap (Q5084484) (← links)
• TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING (Q5168419) (← links)
• Large-scale heterogeneous service systems with general packing constraints (Q5233159) (← links)
• Tight approximation algorithms for geometric bin packing with skewed items (Q6053472) (← links)
• Peak demand minimization via sliced strip packing (Q6066765) (← links)
• There is no APTAS for 2-dimensional vector bin packing: revisited (Q6072215) (← links)