3 search results - page 1 / 1 » Semi-normal Schedulings: Improvement on Goemans' Algorithm |
ISAAC
2001
Springer
13 years 9 months ago
2001
Springer
ESA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
FOCS
2000
IEEE
13 years 8 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...