default search action
"On the relationship between combinatorial and LP-based lower bounds for ..."
R. N. Uma, Joel Wein, David P. Williamson (2006)
- R. N. Uma, Joel Wein, David P. Williamson:
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems. Theor. Comput. Sci. 361(2-3): 241-256 (2006)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.