Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

SODA
2008
ACM

favoriteEmaildiscussreport

75views Algorithms» more SODA 2008»

Graph balancing: a special case of scheduling unrelated parallel machines

13 years 6 months ago

Graph balancing: a special case of scheduling unrelated parallel machines

Download artax.karlin.mff.cuni.cz

Tomás Ebenlendr, Marek Krcal, Jiri Sgall

Real-time Traffic

Algorithms | SODA 2008 |

claim paper

Related Content

» Review of properties of different precedence graphs for scheduling problems

» Machine scheduling with resource dependent processing times

» Improved Approximations for Multiprocessor Scheduling Under Uncertainty

» Minimizing Average FlowTime

» Minimizing Average Flowtime Upper and Lower Bounds

» The tao of parallelism in algorithms

» The Geometry of Truthfulness

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	SODA
Authors	Tomás Ebenlendr, Marek Krcal, Jiri Sgall

Comments (0)