ABSTRACT
Computing maximum weight independent sets in graphs is an important NP-hard optimization problem. The problem is particularly difficult to solve in large graphs for which data reduction techniques do not work well. To be more precise, state-of-the-art branch-and-reduce algorithms can solve many large-scale graphs if reductions are applicable. Otherwise, their performance quickly degrades due to branching requiring exponential time. In this paper, we develop an advanced memetic algorithm to tackle the problem, which incorporates recent data reduction techniques to compute near-optimal weighted independent sets in huge sparse networks. More precisely, we use a memetic approach to recursively choose vertices that are likely to be in a large-weight independent set. We include these vertices into the solution, and further reduce the graph. We show that identifying and removing vertices likely to be in large-weight independent sets opens up the reduction space and speeds up the computation of large-weight independent sets remarkably. Our experimental evaluation indicates that we are able to outperform state-of-the-art algorithms. For example, our two algorithm configurations compute the best results among all competing algorithms for 205 out of 207 instances. Thus can be seen as a useful tool when large-weight independent sets need to be computed in practice.
Supplemental Material
Available for Download
Supplemental material.
- [n. d.]. OpenStreetMap. https://www.openstreetmap.org ([n. d.]). https://www.openstreetmap.orgGoogle Scholar
- [n. d.]. SuiteSparce Matrix Collection. https://sparse.tamu.edu ([n. d.]). https://sparse.tamu.eduGoogle Scholar
- Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, and Darren Strash. 2022. Recent Advances in Practical Data Reduction. In Algorithms for Big Data: DFG Priority Program 1736, Hannah Bast, Claudius Korzen, Ulrich Meyer, and Manuel Penschuck (Eds.). Springer Nature Switzerland, Cham, 97--133. Google ScholarCross Ref
- T. Akiba and Y. Iwata. 2016. Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover. Theoretical Computer Science 609, Part 1 (2016), 211--225. Google ScholarDigital Library
- Gabriela Alexe, Peter L Hammer, Vadim V Lozin, and Dominique de Werra. 2003. Struction revisited. Discrete applied mathematics 132, 1--3 (2003), 27--46. Google ScholarDigital Library
- Diogo V. Andrade, Mauricio G.C. Resende, and Renato F. Werneck. 2012. Fast local search for the maximum independent set problem. Journal of Heuristics 18, 4 (2012), 525--547. Google ScholarDigital Library
- Luitpold Babel. 1994. A fast algorithm for the maximum weight clique problem. Computing 52, 1 (1994), 31--38. Google ScholarCross Ref
- Egon Balas and Chang Sung Yu. 1986. Finding a maximum clique in an arbitrary graph. SIAM J. Comput. 15, 4 (1986), 1054--1068. Google ScholarDigital Library
- Lukas Barth, Benjamin Niedermann, Martin Nöllenburg, and Darren Strash. 2016. Temporal Map Labeling: A New Unified Framework with Experiments. In Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS '16). ACM, 23:1--23:10. Google ScholarDigital Library
- Sergiy Butenko and Svyatoslav Trukhanov. 2007. Using critical sets to solve the maximum independent set problem. Operations Research Letters 35, 4 (2007), 519--524. Google ScholarDigital Library
- Shaowei Cai, Wenying Hou, Jinkun Lin, and Yuanjie Li. 2018. Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI 2018). 1412--1418. Google ScholarCross Ref
- Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, and Dorothea Wagner. 2022. More Recent Advances in (Hyper)Graph Partitioning. CoRR abs/2205.13202 (2022). arXiv:2205.13202 Google ScholarCross Ref
- Timothy A Davis and Yifan Hu. 2011. The University of Florida sparse matrix collection. ACM Transactions on Mathematical Software (TOMS) 38, 1 (2011), 1--25.Google ScholarDigital Library
- Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, and Quico Spaen. 2022. A Local Search Algorithm for Large Maximum Weight Independent Set Problems. In 30th Annual European Symposium on Algorithms, ESA 2022, September 5--9, 2022, Berlin/Potsdam, Germany (LIPIcs, Vol. 244), Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 45:1--45:16. Google ScholarCross Ref
- Ch Ebenegger, PL Hammer, and D De Werra. 1984. Pseudo-Boolean functions and stability of graphs. In North-Holland mathematics studies. Vol. 95. Elsevier, 83--97. Google ScholarCross Ref
- Zhiwen Fang, Chu-Min Li, and Ke Xu. 2016. An exact algorithm based on maxsat reasoning for the maximum weight clique problem. Journal of Artificial Intelligence Research 55 (2016), 799--833.Google ScholarDigital Library
- M. R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman.Google ScholarDigital Library
- Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, and Bogdán Zaválnij. 2021. Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. In Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10--11, 2021, Martin Farach-Colton and Sabine Storandt (Eds.). SIAM, 128--142. Google ScholarCross Ref
- Andreas Gemsa, Martin Nöllenburg, and Ignaz Rutter. 2016. Evaluation of labeling strategies for rotating maps. Journal of Experimental Algorithmics (JEA) 21 (2016), 1--21.Google ScholarDigital Library
- Ernestine Großmann, Sebastian Lamm, Christian Schulz, and Darren Strash. 2022. Finding Near-Optimal Weight Independent Sets at Scale. CoRR abs/2208.13645 (2022). arXiv:2208.13645 Google ScholarCross Ref
- A. Grosso, M. Locatelli, and W. Pullan. 2008. Simple Ingredients Leading to Very Efficient Heuristics for the Maximum Clique Problem. J. Heuristics 14, 6 (2008), 587--612.Google ScholarDigital Library
- Jiewei Gu, Weiguo Zheng, Yuzheng Cai, and Peng Peng. 2021. Towards Computing a Near-Maximum Weighted Independent Set on Massive Graphs. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. 467--477.Google ScholarDigital Library
- Stephan Held, William Cook, and Edward C Sewell. 2012. Maximum-weight stable sets and safe lower bounds for graph coloring. Mathematical Programming Computation 4, 4 (2012), 363--381.Google ScholarCross Ref
- Demian Hespe, Sebastian Lamm, Christian Schulz, and Darren Strash. 2020. WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track. In Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, CSC 2020, Seattle, USA, February 11--13, 2020, H. Martin Bücker, Xiaoye Sherry Li, and Sivasankaran Rajamanickam (Eds.). SIAM, 1--11. Google ScholarCross Ref
- Sen Huang, Mingyu Xiao, and Xiaoyu Chen. 2021. Exact Algorithms for Maximum Weighted Independent Set on Sparse Graphs (Extended Abstract). In Intl. Conf. on Computing and Combinatorics (COCOON), Vol. 13025. 617--628. Google ScholarDigital Library
- Hua Jiang, Chu-Min Li, and Felip Manya. 2017. An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs.. In AAAI. 830--838.Google Scholar
- J. Kim, I. Hwang, Y. H. Kim, and B. R. Moon. 2011. Genetic Approaches for Graph Partitioning: A Survey. In Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference (GECCO'11). ACM, 473--480.Google Scholar
- Sebastian Lamm, Peter Sanders, and Christian Schulz. 2015. Graph partitioning for independent sets. In International Symposium on Experimental Algorithms. Springer, 68--81.Google ScholarDigital Library
- Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, and Renato F. Werneck. 2017. Finding near-optimal independent sets at scale. Journal of Heuristics 23, 4 (2017), 207--229. Google ScholarDigital Library
- Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, and Huashuo Zhang. 2019. Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. In Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7--8, 2019, Stephen G. Kobourov and Henning Meyerhenke (Eds.). SIAM, 144--158. Google ScholarCross Ref
- Kenneth Langedal, Johannes Langguth, Fredrik Manne, and Daniel Thilo Schroeder. 2022. Efficient Minimum Weight Vertex Cover Heuristics Using Graph Neural Networks. In 20th International Symposium on Experimental Algorithms (SEA 2022). Schloss Dagstuhl-Leibniz-Zentrum für Informatik.Google Scholar
- Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. URL http://snap.stanford.edu/data.Google Scholar
- Chu-Min Li, Hua Jiang, and Felip Manyà. 2017. On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem. Computers & Operations Research 84 (2017), 1--15. Google ScholarDigital Library
- Ruizhi Li, Shuli Hu, Shaowei Cai, Jian Gao, Yiyuan Wang, and Minghao Yin. 2019. NuMWVC: A novel local search for minimum weighted vertex cover problem. Journal of the Operational Research Society (2019), 1--12. Google ScholarCross Ref
- Franco Mascia, Elisa Cilia, Mauro Brunato, and Andrea Passerini. 2010. Predicting structural and functional sites in proteins by searching for maximum-weight cliques. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 24. 1274--1279.Google ScholarCross Ref
- B. L Miller and D. E Goldberg. 1996. Genetic Algorithms, Tournament Selection, and the Effects of Noise. Evolutionary Computation 4, 2 (1996), 113--131.Google ScholarDigital Library
- Bruno Nogueira, Rian G. S. Pinheiro, and Anand Subramanian. 2018. A hybrid iterated local search heuristic for the maximum weight independent set problem. Optimization Letters 12, 3 (2018), 567--583. Google ScholarCross Ref
- Patric RJ Östergård. 2002. A fast algorithm for the maximum clique problem. Discrete Applied Mathematics 120, 1--3 (2002), 197--207. Google ScholarDigital Library
- Steffen Rebennack, Marcus Oswald, Dirk Oliver Theis, Hanna Seitz, Gerhard Reinelt, and Panos M Pardalos. 2011. A branch and cut solver for the maximum stable set problem. Journal of combinatorial optimization 21, 4 (2011), 434--457. Google ScholarDigital Library
- P. San Segundo, F. Matia, D. Rodriguez-Losada, and M. Hernando. 2013. An improved bit parallel exact maximum clique algorithm. Optimization Letters 7, 3 (2013), 467--479. Google ScholarCross Ref
- P. San Segundo, D. Rodríguez-Losada, and J. Agustín. 2011. An exact bit-parallel algorithm for the maximum clique problem. Computers & Operations Research 38, 2 (2011), 571--581. Google ScholarDigital Library
- Pedro V Sander, Diego Nehab, Eden Chlamtac, and Hugues Hoppe. 2008. Efficient traversal of mesh edges using adjacency primitives. ACM Transactions on Graphics (TOG) 27, 5 (2008), 1--9. Google ScholarDigital Library
- P. Sanders and C. Schulz. [n. d.]. KaHIP - Karlsruhe High Qualtity Partitioning Homepage. ([n. d.]). http://algo2.iti.kit.edu/documents/kahip/index.html.Google Scholar
- P. Sanders and C. Schulz. 2011. Engineering Multilevel Graph Partitioning Algorithms. In 19th European Symposium on Algorithms (LNCS, Vol. 6942). Springer, 469--480.Google Scholar
- P. Sanders and C. Schulz. 2016. Advanced Multilevel Node Separator Algorithms. In Experimental Algorithms - 15th International Symposium, (SEA), Proceedings (LNCS, Vol. 9685). Springer, 294--309. Google ScholarDigital Library
- Christian Schulz and Darren Strash. 2019. Graph Partitioning: Formulations and Applications to Big Data. In Encyclopedia of Big Data Technologies. Springer International Publishing, 858--864. Google ScholarCross Ref
- Alan J Soper, Chris Walshaw, and Mark Cross. 2004. A combined evolutionary search and multilevel optimisation approach to graph-partitioning. Journal of Global Optimization 29, 2 (2004), 225--241.Google ScholarDigital Library
- E. Tomita, Y. Sutani, T. Higashi, S. Takahashi, and M. Wakatsuki. 2010. A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. In WALCOM: Algorithms and Computation, Md. Saidur Rahman and Satoshi Fujita (Eds.). LNCS, Vol. 5942. Springer Berlin Heidelberg, 191--203. Google ScholarDigital Library
- Jeffrey S Warren and Illya V Hicks. 2006. Combinatorial branch-and-bound for the maximum weight independent set problem. (2006). https://www.caam.rice.edu/~ivhicks/jeff.rev.pdfGoogle Scholar
- Deepak Warrier. 2007. A branch, price, and cut approach to solving the maximum weighted independent set problem. Ph. D. Dissertation. Texas A&M University. 1/5814 Google ScholarCross Ref
- Deepak Warrier, Wilbert E Wilhelm, Jeffrey S Warren, and Illya V Hicks. 2005. A branch-and-price approach for the maximum weight independent set problem. Networks: An International Journal 46, 4 (2005), 198--209. Google ScholarCross Ref
- Qinghua Wu and Jin-Kao Hao. 2015. Solving the winner determination problem via a weighted maximum clique heuristic. Expert Systems with Applications 42, 1 (2015), 355--365. Google ScholarDigital Library
- Mingyu Xiao, Sen Huang, Yi Zhou, and Bolin Ding. 2021. Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set. In WWW '21: The Web Conference 2021, Virtual Event / Ljubljana, Slovenia, April 19--23, 2021, Jure Leskovec, Marko Grobelnik, Marc Najork, Jie Tang, and Leila Zia (Eds.). ACM / IW3C2, 3930--3940. Google ScholarDigital Library
- Hong Xu, TK Satish Kumar, and Sven Koenig. 2016. A new solver for the minimum weighted vertex cover problem. In International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems. Springer, 392--405. Google ScholarCross Ref
- Weiguo Zheng, Jiewei Gu, Peng Peng, and Jeffrey Xu Yu. 2020. Efficient Weighted Independent Set Computation over Large Graphs. In IEEE Intl. Conf. on Data Engineering (ICDE). 1970--1973. Google ScholarCross Ref
Recommendations
Finding near-optimal independent sets at scale
The maximum independent set problem is NP-hard and particularly difficult to solve in sparse graphs, which typically take exponential time to solve exactly using the best-known exact algorithms. In this paper, we present two new novel heuristic ...
Maximum Weight Independent Sets in hole- and co-chair-free graphs
The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. Being one of the most investigated and most important problems on graphs, it is well known to be NP-...
Independent Sets of Maximum Weight in Apple-Free Graphs
We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs,...
Comments