Sciweavers

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

13

ICALP
2005
Springer

favoriteEmaildiscussreport

113views Programming Languages» more ICALP 2005»

A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines

13 years 10 months ago

A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines

Download www.icsi.berkeley.edu

Martin Gairing, Burkhard Monien, Andreas Woclaw

Real-time Traffic

ICALP 2005 | Theoretical Computer Science |

claim paper

Related Content

» Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines

» Grouping Techniques for Scheduling Problems Simpler and Faster

» Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Mach...

» Convex programming for scheduling unrelated parallel machines

» Scheduling Unrelated Machines by Randomized Rounding

» A General Framework for Designing Approximation Schemes for Combinatorial Optimization Pro...

» The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders

» Preemptive Scheduling with Rejection

» Multiphase Algorithms for Throughput Maximization for RealTime Scheduling

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ICALP
Authors	Martin Gairing, Burkhard Monien, Andreas Woclaw

Comments (0)