Pages that link to "Item:Q4895561"

The following pages link to Coordination Complexity of Parallel Price-Directive Decomposition (Q4895561):

Displaying 24 items.

• Faster min-max resource sharing in theory and practice (Q542051) (← links)
• A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
• Self-concordant barriers for convex approximations of structured convex sets (Q707744) (← links)
• On randomized fictitious play for approximating saddle points over convex sets (Q747628) (← links)
• Global convergence of a smooth approximation method for mathematical programs with complementarity constraints (Q857941) (← 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)
• Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
• On routing in VLSI design and communication networks (Q944702) (← links)
• Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
• Packing trees in communication networks (Q1016048) (← links)
• Flows with unit path capacities and related packing and covering problems (Q1041430) (← links)
• Regularized smoothing approximations to vertical nonlinear complementarity problems (Q1284038) (← links)
• Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time (Q1363422) (← links)
• An asymptotic fully polynomial time approximation scheme for bin covering. (Q1426473) (← links)
• Computer science and decision theory (Q2271874) (← 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)
• Approximation schemes for job shop scheduling problems with controllable processing times (Q2485329) (← links)
• An approximation algorithm for the general max-min resource sharing problem (Q2492678) (← links)
• Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
• On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
• (Q5020878) (← links)
• APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS (Q5315931) (← links)