Approximations of weighted independent set and hereditary subset problems

Authors:
Magnús M. Halldórsson
Affiliations:
Science Institute, University of Iceland, Reykjavik, Iceland and Department of Informatics, University of Bergen, Norway
Venue:
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Year:
1999

Citing 11
Cited 9

Approximating maximum independent sets by excluding subgraphs

BIT
Approximate graph coloring by semidefinite programming

Journal of the ACM (JACM)
Approximating the independence number via the j -function

Mathematical Programming: Series A and B
Improved approximations of independent sets in bounded-degree graphs via subgraph removal

Nordic Journal of Computing
Approximating Maximum Independent Sets in Uniform Hypergraphs

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Independent Sets with Domination Constraints

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Approximating Maximum Independent Set in k-Clique-Free Graphs

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Derandomizing semidefinite programming based approximation algorithms

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-random Graphs

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Clique is hard to approximate within n1-

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Algorithm for optimal winner determination in combinatorial auctions

Artificial Intelligence
Conversion of coloring algorithms into maximum weight independent set algorithms

Discrete Applied Mathematics
Effective techniques for the generalized low-power binding problem

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Cache-conscious coallocation of hot data streams

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Leveraging aggregate constraints for deduplication

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Approximation of min coloring by moderately exponential algorithms

Information Processing Letters
Conversion of coloring algorithms into maximum weight independent set algorithms

Discrete Applied Mathematics
On-line computation and maximum-weighted hereditary subgraph problems

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Elimination graphs

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.