Pages that link to "Item:Q3586449"

The following pages link to A Robust PTAS for Machine Covering and Packing (Q3586449):

Displaying 8 items.

• A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
• Robust algorithms for preemptive scheduling (Q472464) (← links)
• On-line machine covering on two machines with local migration (Q660883) (← links)
• Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
• The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online (Q3460333) (← links)
• Simultaneously load balancing for every p-norm, with reassignments (Q4638106) (← links)
• A Robust AFPTAS for Online Bin Packing with Polynomial Migration (Q5241236) (← links)
• Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem (Q6202754) (← links)