Pages that link to "Item:Q2884281"

The following pages link to Tight Approximation Algorithms for Maximum Separable Assignment Problems (Q2884281):

Displaying 16 items.

• Approximability of scheduling problems with resource consuming jobs (Q256641) (← links)
• Improved approximation algorithms for box contact representations (Q521820) (← links)
• Truthful mechanism design via correlated tree rounding (Q526848) (← links)
• The transportation problem with conflicts (Q829180) (← links)
• Online interval scheduling with a bounded number of failures (Q1707823) (← links)
• A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
• On the approximability of the two-phase knapsack problem (Q2279756) (← links)
• A polynomial-time approximation scheme for the airplane refueling problem (Q2327962) (← links)
• Packing items into several bins facilitates approximating the separable assignment problem (Q2345851) (← links)
• Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844) (← links)
• On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
• Approximation algorithms for the generalized incremental knapsack problem (Q2687039) (← links)
• Approximability of Two Variants of Multiple Knapsack Problems (Q2947034) (← links)
• (Q5009517) (← links)
• (Q5075815) (← links)
• Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays (Q5106360) (← links)