Join Literal
Authors

Author

M. T. Kaufman

Books

An almost-optimal algorithm for the assembly line scheduling problem
An almost-optimal algorithm for the assembly line scheduling problem
Stanford University. Computer Science Department, M. T. Kaufman

Your next favorite book is out there

Track your reading, share the passages worth remembering, and get recommendations from people you trust — not algorithms. Independent, free, and no ads.

Download on the App Store
... or sign up right here