The following pages link to (Q4536419):
Displaying 4 items.
- An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs (Q845858) (← links)
- On the complexity of constructing multiprocessor little-preemptive schedules (Q902062) (← links)
- An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212) (← links)
- An absolute approximation algorithm for scheduling unrelated machines (Q3423277) (← links)
