Pages that link to "Item:Q5384022"

The following pages link to Polynomiality for Bin Packing with a Constant Number of Item Types (Q5384022):

Displaying 29 items.

• Online bin packing with advice (Q261387) (← links)
• Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory (Q314827) (← links)
• Parameterized complexity of strip packing and minimum volume packing (Q501656) (← links)
• Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
• Scheduling and fixed-parameter tractability (Q896271) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• An EPTAS for scheduling fork-join graphs with communication delay (Q1998847) (← links)
• Feasibility criteria for high-multiplicity partitioning problems (Q2069802) (← links)
• Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
• Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
• Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
• Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\) (Q2326400) (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• Parameterized complexity of configuration integer programs (Q2670456) (← links)
• Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← links)
• Block-structured integer programming: can we parameterize without the largest coefficient? (Q2684049) (← links)
• Closing the Gap for Makespan Scheduling via Sparsification Techniques (Q3387928) (← links)
• About the Structure of the Integer Cone and Its Application to Bin Packing (Q3387933) (← links)
• Huge Unimodular $n$-Fold Programs (Q3455242) (← links)
• The Support of Integer Optimal Solutions (Q4577743) (← links)
• (Q5089171) (← links)
• (Q5090421) (← links)
• (Q5111743) (← links)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
• A PTAS for Scheduling Unrelated Machines of Few Different Types (Q5895057) (← links)
• Streaming algorithms for bin packing and vector scheduling (Q5919096) (← links)
• An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)
• Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines (Q6065415) (← links)
• A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics (Q6089980) (← links)