David P. Williamson
Home
Posts
Publications
Talks
Courses
Contact
CV
Joel M. Wein
Latest
On the relationship between combinatorial and LP-based lower bounds to NP-hard scheduling problems.
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem.
Cite
×