Parameterized algorithms and computational lower bounds: a structural approach
Many problems of practical significance are known to be NP-hard, and hence, are unlikely to be solved by polynomial-time algorithms. There are several ways to cope with the NP-hardness of a certain problem. The most popular approaches include heuristic algorithms, approximation algorithms, and rando...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
Texas A&M University
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1969.1/4322 |