R. N. Uma, Joel Wein, David P. Williamson. On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems. Theoretical Computer Science, 361(2-3):241-256, 2006. [doi]
@article{UmaWW06,
title = {On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems},
author = {R. N. Uma and Joel Wein and David P. Williamson},
year = {2006},
doi = {10.1016/j.tcs.2006.05.013},
url = {http://dx.doi.org/10.1016/j.tcs.2006.05.013},
tags = {rule-based},
researchr = {https://researchr.org/publication/UmaWW06},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {361},
number = {2-3},
pages = {241-256},
}