LIPIcs.STACS.2021.53.pdf
- Filesize: 0.79 MB
- 20 pages
Document
An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs
Author
Meike Neuwohner 
-
Part of:
Volume:
38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Theoretical Aspects of Computer Science (STACS) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2021-03-10
File
Document Identifiers
Author Details
Cite As Get BibTex
Meike Neuwohner. An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs. In 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 187, pp. 53:1-53:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.STACS.2021.53
Abstract
In this paper, we consider the task of computing an independent set of maximum weight in a given d-claw free graph G = (V,E) equipped with a positive weight function w:V → ℝ^+. Thereby, d ≥ 2 is considered a constant. The previously best known approximation algorithm for this problem is the local improvement algorithm SquareImp proposed by Berman [Berman, 2000]. It achieves a performance ratio of d/2+ε in time 𝒪(|V(G)|^(d+1)⋅(|V(G)|+|E(G)|)⋅(d-1)²⋅ (d/(2ε)+1)²) for any ε > 0, which has remained unimproved for the last twenty years. By considering a broader class of local improvements, we obtain an approximation ratio of d/2-(1/63,700,992)+ε for any ε > 0 at the cost of an additional factor of 𝒪(|V(G)|^(d-1)²) in the running time. In particular, our result implies a polynomial time d/2-approximation algorithm. Furthermore, the well-known reduction from the weighted k-Set Packing Problem to the Maximum Weight Independent Set Problem in k+1-claw free graphs provides a (k+1)/2 -(1/63,700,992)+ε-approximation algorithm for the weighted k-Set Packing Problem for any ε > 0. This improves on the previously best known approximation guarantee of (k+1)/2 + ε originating from the result of Berman [Berman, 2000].
Subject Classification
ACM Subject Classification
- Theory of computation → Packing and covering problems
Keywords
- d-Claw free Graphs
- independent Set
- local Improvement
- k-Set Packing
- weighted
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Esther M. Arkin and Refael Hassin. On local search for weighted k-set packing. Mathematics of Operations Research, 23(3):640-648, 1998. URL: https://doi.org/10.1287/moor.23.3.640.
- Piotr Berman. A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. In Scandinavian Workshop on Algorithm Theory, pages 214-219. Springer, 2000. URL: https://doi.org/10.1007/3-540-44985-X_19.
- Barun Chandra and Magnús M. Halldórsson. Greedy Local Improvement and Weighted Set Packing Approximation. Journal of Algorithms, 39(2):223-240, 2001. URL: https://doi.org/10.1006/jagm.2000.1155.
- Marek Cygan. Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pages 509-518. IEEE Computer Society, 2013. URL: https://doi.org/10.1109/FOCS.2013.61.
- Marek Cygan, Fabrizio Grandoni, and Monaldo Mastrolilli. How to Sell Hyperedges: The Hypermatching Assignment Problem. In Proceedings of the 2013 Annual ACM-SIAM Symposium on Discrete Algorithms, pages 342-351. SIAM, 2013. URL: https://doi.org/10.1137/1.9781611973105.25.
- Martin Fürer and Huiwen Yu. Approximating the k-Set Packing Problem by Local Improvements. In International Symposium on Combinatorial Optimization, pages 408-420. Springer, 2014. URL: https://doi.org/10.1007/978-3-319-09174-7_35.
- Magnús M. Halldórsson. Approximating Discrete Collections via Local Improvements. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, page 160–169, USA, 1995. Society for Industrial and Applied Mathematics. URL: http://dl.acm.org/citation.cfm?id=313651.313687.
- Elad Hazan, Shmuel Safra, and Oded Schwartz. On the complexity of approximating k-Set Packing. Computational Complexity, 15:20-39, 2006. URL: https://doi.org/10.1007/s00037-006-0205-6.
- Cor A. J. Hurkens and Alexander Schrijver. On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM Journal on Discrete Mathematics, 2(1):68-72, 1989. URL: https://doi.org/10.1137/0402008.
- George J. Minty. On Maximal Independent Sets of Vertices in Claw-Free Graphs. Journal of Combinatorial Theory, Series B, 28(3):284-304, 1980. URL: https://doi.org/10.1016/0095-8956(80)90074-X.
- Daishin Nakamura and Akihisa Tamura. A revision of Minty’s algorithm for finding a maximum weight stable set of a claw-free graph. Journal of the Operations Research Society of Japan, 44(2):194-204, 2001. URL: https://doi.org/10.15807/jorsj.44.194.
- Najiba Sbihi. Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoile. Discrete Mathematics, 29(1):53-76, 1980. URL: https://doi.org/10.1016/0012-365X(90)90287-R.
- Maxim Sviridenko and Justin Ward. Large Neighborhood Local Search for the Maximum Set Packing Problem. In International Colloquium on Automata, Languages, and Programming, pages 792-803. Springer, 2013. URL: https://doi.org/10.1007/978-3-642-39206-1_67.