Sciweavers

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

14

SODA
1998
ACM

favoriteEmaildiscussreport

68views Algorithms» more SODA 1998»

An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems

13 years 5 months ago

An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems

Download www2.isye.gatech.edu

Martin W. P. Savelsbergh, R. N. Uma, Joel Wein

Real-time Traffic

Algorithms | SODA 1998 |

claim paper

Related Content

» Approximating Single Machine Scheduling with Scenarios

» An Experimental Study of Algorithms for Weighted Completion Time Scheduling

» Approximating the independent domatic partition problem in random geometric graphs an exp...

» Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Pr...

» Experimental study of hybridtype distributed maximal constraint satisfaction algorithm

» Approximations and Randomization to Boost CSP Techniques

» Approximation algorithm for the temperatureaware scheduling problem

» A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem

» Approximation Algorithms for Wireless Link Scheduling With SINRBased Interference

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	1998
Where	SODA
Authors	Martin W. P. Savelsbergh, R. N. Uma, Joel Wein

Comments (0)