Kernelization and Enumeration: New Approaches to Solving Hard Problems
NP-Hardness is a well-known theory to identify the hardness of computational problems. It is believed that NP-Hard problems are unlikely to admit polynomial-time algorithms. However since many NP-Hard problems are of practical significance, different approaches are proposed to solve them: Approximat...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7845 |