Pages that link to "Item:Q2719242"

The following pages link to Approximate Max-Min Resource Sharing for Structured Concave Optimization (Q2719242):

Displaying 18 items.

• New approximability results for two-dimensional bin packing (Q261358) (← links)
• An improved approximation scheme for variable-sized bin packing (Q504994) (← links)
• On randomized fictitious play for approximating saddle points over convex sets (Q747628) (← links)
• Faster and simpler approximation algorithms for mixed packing and covering problems (Q884474) (← links)
• Approximation algorithms for general packing problems and their application to the multicast congestion problem (Q925266) (← links)
• Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
• On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms (Q1318656) (← links)
• A faster FPTAS for the unbounded knapsack problem (Q1678097) (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs (Q2414864) (← links)
• An approximation algorithm for the general max-min resource sharing problem (Q2492678) (← links)
• APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS (Q2905284) (← links)
• On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
• Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times (Q4972675) (← links)
• Finding Sparse Solutions for Packing and Covering Semidefinite Programs (Q5071107) (← links)
• Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs (Q5075785) (← links)
• A Robust AFPTAS for Online Bin Packing with Polynomial Migration (Q5241236) (← links)
• Improved approximation algorithms for minimum power covering problems (Q5919677) (← links)