Pages that link to "Item:Q463715"

The following pages link to An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715):

Displaying 12 items.

• Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
• EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q2085740) (← links)
• Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← links)
• A unified framework for designing EPTAS for load balancing on parallel machines (Q2415372) (← links)
• The benefit of preemption with respect to the \(\ell_p\) norm (Q2417189) (← links)
• Fair allocation of indivisible goods: beyond additive valuations (Q2667816) (← links)
• Approximate separable multichoice optimization over monotone systems (Q2673246) (← links)
• Fair Allocation of Indivisible Goods: Improvement (Q4958554) (← links)
• Fixed-Parameter Approximation Schemes for Weighted Flowtime. (Q5009522) (← links)
• Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs (Q6065410) (← links)
• EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q6108926) (← links)
• EPTAS for parallel identical machine scheduling with time restrictions (Q6123390) (← links)