The buffered work-pool approach for search-tree based optimization algorithms
Recent advances in algorithm design have shown a growing interest in seeking exact solutions to many hard problems. This new trend has been motivated by hardness of approximation results that appeared in the last decade, and has taken a great boost by the emergence of parameterized complexity theory...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | conferenceObject |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/10725/5381 http://dx.doi.org/10.1007/978-3-540-68111-3_19 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://link.springer.com/chapter/10.1007/978-3-540-68111-3_19 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|