Tight lower bounds for certain parameterized NP-hard problems.
Jianer ChenBenny ChorMike FellowsXiuzhen HuangDavid W. JuedesIyad A. KanjGe XiaPublished in: Inf. Comput. (2005)
Keyphrases
- lower bound
- np hard problems
- np hard
- upper bound
- knapsack problem
- branch and bound algorithm
- worst case
- constraint programming
- optimal solution
- scheduling problem
- branch and bound
- objective function
- np complete
- linear programming
- combinatorial search
- constraint satisfaction problems
- graph coloring
- combinatorial optimization problems
- optimization algorithm
- integer programming
- search procedure
- max sat