Abstract
This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in terms of the maximum or average degree of the hypergraph. We extend this to the weighted case and give a \(O(\bar{D} \log\log \bar{D}/\log \bar{D})\) bound, where \(\bar{D}\) is the average weighted degree in a hypergraph, matching the best bounds known for the special case of graphs. Our approach is to use an semi-definite technique to sparsify a given hypergraph and then apply combinatorial algorithms to find a large independent set in the resulting sparser instance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Kahale, N.: Approximating the independence number via the θ-function. Math. Prog. 80(3), 253–264 (1998)
Bazgan, C., Monnot, J., Paschos, V., Serrière, F.: On the differential approximation of MIN SET COVER. Theor. Comp. Science 332, 497–513 (2005)
Caro, Y., Tuza, Z.: Improved lower bounds on k-independence. J. Graph Theory 15, 99–107 (1991)
Feige, U.: Approximating maximum clique by removing subgraphs. SIAM J. Disc. Math. 18(2), 219–225 (2005)
Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169–197 (1981)
Halldórsson, M.M.: Approximations of independent sets in graphs. In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol. 1444, pp. 1–13. Springer, Heidelberg (1998)
Halldórsson, M.M.: Approximations of Weighted Independent Set and hereditary subset problems. J. Graph Algorithms and Applications 4(1), 1–16 (2000)
Halldórsson, M.M., Losievskaja, E.: Independent sets in bounded-degree hypergraphs. Disc. Appl. Math. 157, 1773–1786 (2009)
Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM J. Computing 31(5), 1608–1623 (2002)
Karger, D., Motwani, R., Sudan, M.: Approximate graph coloring by semidefinite programming. J. ACM 45(2), 246–265 (1998)
Krivelevich, M., Nathaniel, R., Sudakov, B.: Approximating coloring and maximum independent sets in 3-uniform hypergraphs. J. Algorithms 41(1), 99–113 (2001)
Lovász, L.: On Shannon capacity of a graph. IEEE Trans. Inform. Theory 25(1), 1–7 (1979)
Mahajan, S., Ramesh, H.: Derandomizing semidefinite programming based approximation algorithms. SIAM J. Computing 28(5), 1641–1663 (1999)
Rényi, A.: Probability theory. Elsevier, New York (1970)
Shachnai, H., Srinivasan, A.: Finding large independent sets of hypergraphs in parallel. SIAM J. Disc. Math. 18(3), 488–500 (2005)
Thiele, T.: A lower bound on the independence number of arbitrary hypergraphs. J. Graph Theory 32, 241–249 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agnarsson, G., Halldórsson, M.M., Losievskaja, E. (2009). SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds) Automata, Languages and Programming. ICALP 2009. Lecture Notes in Computer Science, vol 5555. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02927-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-02927-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02926-4
Online ISBN: 978-3-642-02927-1
eBook Packages: Computer ScienceComputer Science (R0)