David P. Williamson
Home
Posts
Publications
Talks
Courses
Contact
CV
On the relationship between combinatorial and LP-based lower bounds to NP-hard scheduling problems.
R.N. Uma
,
Joel M. Wein
,
David P. Williamson
September 2006
Scheduling
Cite
DOI
Type
Journal article
Publication
Theoretical Computer Science
361:241-256, 2006.
Cite
×