The focus of this study is to clarify the approximability of the important versions of the maximum independent set problem, and to apply, where possible, the technique to related hereditary subgraph and subset problem. We report improved performance ratios for the Independent Set problem in weighted general graphs, weighted bounded-degree graphs, and in sparse graphs. Other problems with better than previously reported ratios include Weighted Set Packing, Longest Subsequence, Maximum Independent Sequence, and Independent Set in hypergraphs.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- Approximations of Weighted Independent Set and Hereditary Subset Problems
Magnús M. Halldórsson
- Springer Berlin Heidelberg