Pages that link to "Item:Q4997316"

The following pages link to Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316):

Displaying 11 items.

• Semidefinite and linear programming integrality gaps for scheduling identical machines (Q1800998) (← links)
• Contention resolution, matrix scaling and fair allocation (Q2085755) (← links)
• Performance guarantees of local search for minsum scheduling problems (Q2118098) (← links)
• Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times (Q2168720) (← links)
• Integrality gaps for colorful matchings (Q2419586) (← links)
• A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies (Q4997320) (← links)
• Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints (Q5060512) (← links)
• Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
• Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
• (Q5361826) (redirect page) (← links)
• Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines (Q6126818) (← links)