Journal of Graph Algorithms and Applications Approximations of Weighted Independent Set and Hereditary Subset Problems

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.

[1]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[2]  János Komlós,et al.  The eigenvalues of random symmetric matrices , 1981, Comb..

[3]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[4]  Dorit S. Hochbaum,et al.  Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..

[5]  Ravi B. Boppana,et al.  Eigenvalues and graph bisection: An average-case analysis , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[6]  Ravi B. Boppana,et al.  Approximating maximum independent sets by excluding subgraphs , 1990, BIT.

[7]  Edward R. Scheinerman.  Generalized Chromatic Numbers of Random Graphs , 1992, SIAM J. Discret. Math..

[8]  Carsten Lund,et al.  The Approximation of Maximum Subgraph Problems , 1993, ICALP.

[9]  Jaikumar Radhakrishnan,et al.  Improved Approximations of Independent Sets in Bounded-Degree Graphs via Subgraph Removal , 1994, Nord. J. Comput..

[10]  D. Welsh,et al.  A Spectral Technique for Coloring Random 3-Colorable Graphs , 1994 .

[11]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

[12]  C. R. Subramanian.  Minimum coloring random and semi-random graphs in polynomial expected time , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[13]  Joel H. Spencer,et al.  Coloring Random and Semi-Random k-Colorable Graphs , 1995, J. Algorithms.

[14]  Uriel Feige,et al.  Randomized graph products, chromatic numbers, and Lovasz j-function , 1995, STOC '95.

[15]  Ramesh Hariharan,et al.  Derandomizing semidefinite programming based approximation algorithms , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[16]  Franz Rendl,et al.  Nonpolyhedral Relaxations of Graph-Bisection Problems , 1995, SIAM J. Optim..

[17]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[18]  Piotr Berman,et al.  On the Approximation Properties of Independent Set Problem in Degree 3 Graphs , 1999, WADS.

[19]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[20]  J. Håstad.  Clique is hard to approximate within n 1-C , 1996 .

[21]  Hoong Chuin Lau,et al.  Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring , 1997, J. Graph Algorithms Appl..

[22]  Alan M. Frieze,et al.  Algorithmic theory of random graphs , 1997, Random Struct. Algorithms.

[23]  Uriel Feige,et al.  Randomized graph products, chromatic numbers, and the Lovász ϑ-function , 1997, Comb..

[24]  R. R. Vemuganti.  Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey , 1998 .

[25]  David R. Karger,et al.  Approximate graph coloring by semidefinite programming , 1998, JACM.

[26]  J. Kilian,et al.  Heuristics for finding large independent sets, with applications to coloring semi-random graphs , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[27]  Ingo Schiermeyer.  Approximating Maximum Independent Set in k-Clique-Free Graphs , 1998, APPROX.

[28]  Hanno Lefmann,et al.  Approximating Maximum Independent Sets in Uniform Hypergraphs , 1998, MFCS.

[29]  Noga Alon,et al.  Finding a large hidden clique in a random graph , 1998, SODA '98.

[30]  Noga Alon,et al.  Approximating the independence number via theϑ-function , 1998, Math. Program..

[31]  Tuomas Sandholm,et al.  An algorithm for optimal winner determination in combinatorial auctions , 1999, IJCAI 1999.

[32]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[33]  Onn Shehory,et al.  Coalition structure generation with worst case guarantees , 2022 .

[34]  Jan Kratochvíl,et al.  Independent Sets with Domination Constraints , 2000, Discret. Appl. Math..

[35]  Approximations of Weighted Independent Set and Hereditary Subset Problems , 2000 .

[36]  Tatsuya Akutsu,et al.  On the approximation of largest common subtrees and largest common point sets , 2000, Theor. Comput. Sci..

[37]  Eran Halperin,et al.  Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.

[38]  Daniel Lehmann,et al.  Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics , 2000, EC '00.