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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
N. Alon and N. Kahale. Approximating the independence number via the θ function. Math. Programming. To appear.
P. Berman and T. Fujito. On the approximation properties of independent set problem in degree 3 graphs. WADS '95, LNCS #955, 449–460.
R. B. Boppana and M. M. Halldórsson. Approximating maximum independent sets by excluding subgraphs. BIT, 32(2):180–196, June 1992.
P. Crescenzi and V. Kann. A compendium of NP optimization problems. On-line survey at http://www.nada.kth.se.
P. Erdűs. On the graph theorem of Turán (in Hungarian). Mat. Lapok, 21:249–251, 1970.
P. Erdűs and G. Szekeres. A combinatorial problem in geometry. Compositio Math., 2:463–470, 1935.
U. Feige. Randomized graph products, chromatic numbers, and the Lovász θ-function. Combinatorica, 17(1), 79–90, 1997.
U. Feige and J. Kilian. Heuristics for finding large independent sets, with applications to coloring semi-random graphs. FOCS '98.
J. Håstad. Clique is hard to approximate within n 1 − ∈. FOCS '96, 627–636.
M. M. Halldórsson. A survey on independent set approximations. APPROX '98, LNCS # 1444, 1–14
M. M. Halldórsson, J. Kratochvíl, and J. A. Telle. Independent sets with domination constraints. ICALP '98, LNCS # 1443.
M. M. Halldórsson and J. Radhakrishnan. Greed is good: Approximating independent sets in sparse and bounded-degree graphs. Algorithmica, 18:145–163, 1997.
M. M. Halldórsson and J. Radhakrishnan. Improved approximations of independent sets in bounded-degree graphs via subgraph removal. Nordic J. Computing, 1(4):475–492, 1994.
T. Hofmeister and H. Lefmann. Approximating maximum independent sets in uniform hypergraphs. MFCS '98.
D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semi-definite programming. J. ACM, 45,2, 246–265, 1998.
L. Lovász. On the Shannon capacity of a graph. IEEE Trans. Inform. Theory, IT-25(1):1–7, Jan. 1979.
S. Mahajan and H. Ramesh. Derandomizing semidefinite programming based approximation algorithms. FOCS '95, 162–169.
I. Schiermeyer. Approximating independent sets in k-clique-free graphs. APPROX'98.
S. Vishwanathan. Personal communication via J. Radhakrishnan, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Halldórsson, M.M. (1999). Approximations of Weighted Independent Set and Hereditary Subset Problems. In: Asano, T., Imai, H., Lee, D.T., Nakano, Si., Tokuyama, T. (eds) Computing and Combinatorics. COCOON 1999. Lecture Notes in Computer Science, vol 1627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48686-0_26
Download citation
DOI: https://doi.org/10.1007/3-540-48686-0_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66200-6
Online ISBN: 978-3-540-48686-2
eBook Packages: Springer Book Archive