Counting and enumerating independent sets with applications to combinatorial optimization problems

Counting and enumerating maximal and maximum independent sets are well-studied problems in graph theory. In this paper we introduce methods to count and enumerate maximal/maximum independent sets in threshold graphs andk-threshold graphs and improve former results for these problems. The results can be applied to combinatorial optimization problems, and in particular to different variations of the knapsack problem. As feasible solutions for instances of those problems correspond to independent sets in threshold graphs andk-threshold graphs, we obtain polynomial time results for special knapsack and multidimensional knapsack instances. Also, we show lower and upper bounds for the number of necessary bins in several bin packing problems.