Sciweavers

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

161

ICALP
2001
Springer

116views Programming Languages» more ICALP 2001»

A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines

16 years 3 days ago

A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines

Download www.cs.ust.hk

Chandra Chekuri, Sanjeev Khanna

Real-time Traffic

ICALP 2001 | Programming Languages |

claim paper

Related Content

» A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines

» Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

» Semionline scheduling with end of sequence information

» Partially ordered knapsack and applications to scheduling

» Equilibria for two parallel links The strong price of anarchy versus the price of anarchy

Post Info
More Details (n/a)

Added	29 Jul 2010
Updated	29 Jul 2010
Type	Conference
Year	2001
Where	ICALP
Authors	Chandra Chekuri, Sanjeev Khanna

Comments (0)