Sciweavers

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

8

DAM
2007

favoriteEmaildiscussreport

91views more DAM 2007»

A note on the precedence-constrained class sequencing problem

13 years 4 months ago

A note on the precedence-constrained class sequencing problem

Download www.columbia.edu

We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approximation algorithm with performance guarantee (c + 1)/2, where c is the number of colors. This improves upon Tovey’s c–approximation.

José R. Correa, Samuel Fiorini, Nicol&aacut

Real-time Traffic

Approximation Algorithm | DAM 2007 | Scheduling Problem | Short Proof |

claim paper

Related Content

» Optimizing the receiver maneuvers for bearingsonly tracking

» On Revealing Replicating Structures in Multiway Data A Novel Tensor Decomposition Approach

» Dynamic Motion Planning Whole Arm Grasp Systems Based on Switching Contact Modes

» On the complexity of scheduling in wireless networks

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	DAM
Authors	José R. Correa, Samuel Fiorini, Nicolás E. Stier Moses

Comments (0)