Data reductions and combinatorial bounds for improved approximation algorithms
Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of data reduction rules and combinatorial insights. We will expose in this paper a similar strategy for obtaining polynomial-time approximation algorithms. Our method features the use of approximatio...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Published: |
2016
|
| Online Access: | http://hdl.handle.net/10725/4759 http://dx.doi.org/10.1016/j.jcss.2015.11.010 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://www.sciencedirect.com/science/article/pii/S0022000015001336 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|