skip to main content
10.1145/3442381.3450130acmconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
research-article

Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set

Authors Info & Claims
Published:03 June 2021Publication History

ABSTRACT

The maximum independent set problem is one of the most fundamental problems in graph algorithms and has been widely studied in social networks. The weighted version of this problem, where each vertex is assigned a nonnegative weight, also receives a lot of attention due to its potential applications in many areas. However, many nice properties and fast algorithms for the unweighted version can not be extended to the weighted version. In this paper, we study the structural properties of this problem, giving some sufficient conditions for a vertex being or not being in a maximum weighted independent set. These properties provide a suite of reduction rules that includes and generalizes almost all frequently used reduction rules for this problem. These rules can efficiently find partial solutions and greatly reduce the instances, especially for sparse graphs. Based on them, we also propose a simple exact yet practical algorithm. To demonstrate the efficiency of our algorithm, we compare it with state-of-the-art algorithms on several well-known datasets from the real world. The experimental results reveal that our exact algorithm is not only faster than existing algorithms but also can exactly solve more hard instances with 1,000 seconds. For remaining infeasible instances, our reduction rules can also improve existing heuristic algorithms by producing higher-quality solutions using less time.

References

  1. Alexander A. Ageev. 1994. On Finding Critical Independent and Vertex Sets. SIAM J. Discret. Math. 7, 2 (1994), 293–295.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Takuya Akiba and Yoichi Iwata. 2016. Branch-and-Reduce Exponential/FPT Slgorithms in Practice: A Case Study of Vertex Cover. Theor. Comput. Sci. 609(2016), 211–225.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Filipe Araújo, Jorge Farinha, Patrício Domingues, Gheorghe Cosmin Silaghi, and Derrick Kondo. 2011. A Maximum Independent Set Approach for Collusion Detection in Voting Pools. J. Parallel Distributed Comput. 71, 10 (2011), 1356–1366.Google ScholarGoogle ScholarCross RefCross Ref
  4. Luitpold Babel. 1994. A Fast Algorithm for the Maximum Weight Clique Problem. Computing 52, 1 (1994), 31–38.Google ScholarGoogle ScholarCross RefCross Ref
  5. Lukas Barth, Benjamin Niedermann, Martin Nöllenburg, and Darren Strash. 2016. Temporal Map Labeling: A New Unified Framework with Experiments. In SIGSPATIAL/GIS 2016. 23:1–23:10.Google ScholarGoogle Scholar
  6. Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, and Johan M. M. van Rooij. 2012. Fast Algorithms for Max Independent Set. Algorithmica 62, 1-2 (2012), 382–415.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Sergiy Butenko and Svyatoslav Trukhanov. 2007. Using Critical Sets to Solve the Maximum Independent Set Problem. Oper. Res. Lett. 35, 4 (2007), 519–524.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Shaowei Cai, Wenying Hou, Jinkun Lin, and Yuanjie Li. 2018. Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies. In IJCAI 2018. 1412–1418.Google ScholarGoogle ScholarCross RefCross Ref
  9. Shaowei Cai and Jinkun Lin. 2016. Fast Solving Maximum Weight Clique Problem in Massive Graphs. In IJCAI 2016. 568–574.Google ScholarGoogle Scholar
  10. Shaowei Cai, Jinkun Lin, and Chuan Luo. 2017. Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess. J. Artif. Intell. Res. 59 (2017), 463–494.Google ScholarGoogle ScholarCross RefCross Ref
  11. Shaowei Cai, Jinkun Lin, and Kaile Su. 2015. Two Weighting Local Search for Minimum Vertex Cover. In AAAI 2015. 1107–1113.Google ScholarGoogle Scholar
  12. Shaowei Cai, Kaile Su, Chuan Luo, and Abdul Sattar. 2013. NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover. J. Artif. Intell. Res. 46 (2013), 687–716.Google ScholarGoogle ScholarCross RefCross Ref
  13. Jianer Chen, Iyad A. Kanj, and Weijia Jia. 2001. Vertex Cover: Further Observations and Further Improvements. J. Algorithms 41, 2 (2001), 280–301.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Miroslav Chlebík and Janka Chlebíková. 2008. Crown Reductions for the Minimum Weighted Vertex Cover Problem. Discret. Appl. Math. 156, 3 (2008), 292–312.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Vilhelm Dahllöf, Peter Jonsson, and Magnus Wahlström. 2005. Counting Models for 2SAT and 3SAT Formulae. Theor. Comput. Sci. 332, 1-3 (2005), 265–291.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Zhiwen Fang, Chu-Min Li, and Ke Xu. 2016. An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem. J. Artif. Intell. Res. 55 (2016), 799–833.Google ScholarGoogle ScholarCross RefCross Ref
  17. Thomas A. Feo, Mauricio G. C. Resende, and Stuart H. Smith. 1994. A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set. Oper. Res. 42, 5 (1994), 860–878.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Henning Fernau. 2010. Parameterized Algorithms for d-Hitting Set: The Weighted Case. Theor. Comput. Sci. 411, 16-18 (2010), 1698–1713.Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch. 2009. A Measure & Conquer Approach for the Analysis of Exact Algorithms. J. ACM 56, 5 (2009), 25:1–25:32.Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Martin Fürer and Shiva Prasad Kasiviswanathan. 2007. Algorithms for Counting 2-SAT Solutions and Colorings with Applications. In AAIM 2007. 47–57.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Andreas Gemsa, Martin Nöllenburg, and Ignaz Rutter. 2016. Evaluation of Labeling Strategies for Rotating Maps. ACM J. Exp. Algorithmics 21, 1 (2016), 1.4:1–1.4:21.Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Tang Jian. 1986. An O(2Math 13) Algorithm for Solving Maximum Independent Set Problem. IEEE Trans. Computers 35, 9 (1986), 847–851.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Hua Jiang, Chu-Min Li, Yanli Liu, and Felip Manyà. 2018. A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem. In AAAI-18. 1338–1346.Google ScholarGoogle Scholar
  24. Hua Jiang, Chu-Min Li, and Felip Manyà. 2017. An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs. In AAAI-17. 830–838.Google ScholarGoogle Scholar
  25. Yan Jin and Jin-Kao Hao. 2015. General Swap-Based Multiple Neighborhood Tabu Search for the Maximum Independent Set Problem. Eng. Appl. Artif. Intell. 37 (2015), 20–33.Google ScholarGoogle ScholarCross RefCross Ref
  26. Vedat Kavalci, Aybars Ural, and Orhan Dagdeviren. 2014. Distributed Vertex Cover Algorithms For Wireless Sensor Networks. CoRR abs/1402.2140(2014).Google ScholarGoogle Scholar
  27. 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 ALENEX 2019. 144–158.Google ScholarGoogle Scholar
  28. Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http://snap.stanford.edu/data.Google ScholarGoogle Scholar
  29. Chu-Min Li, Yanli Liu, Hua Jiang, Felip Manyà, and Yu Li. 2018. A New Upper Bound for the Maximum Weight Clique Problem. Eur. J. Oper. Res. 270, 1 (2018), 66–77.Google ScholarGoogle ScholarCross RefCross Ref
  30. Ruizhi Li, Shuli Hu, Shaowei Cai, Jian Gao, Yiyuan Wang, and Minghao Yin. 2020. NuMWVC: A Novel Local Search for Minimum Weighted Vertex Cover Problem. J. Oper. Res. Soc. 71, 9 (2020), 1498–1509.Google ScholarGoogle ScholarCross RefCross Ref
  31. Yuanjie Li, Shaowei Cai, and Wenying Hou. 2017. An Efficient Local Search Algorithm for Minimum Weighted Vertex Cover on Massive Graphs. In SSEAL 2017. 145–157.Google ScholarGoogle Scholar
  32. Chung-Shou Liao, Chih-Wei Liang, and Sheung-Hung Poon. 2016. Approximation Algorithms on Consistent Dynamic Map Labeling. Theor. Comput. Sci. 640(2016), 84–93.Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Daniel Lokshtanov, Dániel Marx, and Saket Saurabh. 2011. Lower Bounds Based on the Exponential Time Hypothesis. Bull. EATCS 105(2011), 41–72.Google ScholarGoogle Scholar
  34. Chuan Luo, Holger H. Hoos, Shaowei Cai, Qingwei Lin, Hongyu Zhang, and Dongmei Zhang. 2019. Local Search with Efficient Automatic Configuration for Minimum Vertex Cover. In IJCAI 2019. 1297–1304.Google ScholarGoogle Scholar
  35. Ross M. McConnell and Fabien de Montgolfier. 2005. Linear-Time Modular Decomposition of Directed Graphs. Discret. Appl. Math. 145, 2 (2005), 198–209.Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Rolf Niedermeier and Peter Rossmanith. 2003. On Efficient Fixed-Parameter Algorithms for Weighted Vertex Cover. J. Algorithms 47, 2 (2003), 63–77.Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Bruno C. S. Nogueira, Rian G. S. Pinheiro, and Anand Subramanian. 2018. A Hybrid Iterated Local Search Heuristic for the Maximum Weight Independent Set Problem. Optim. Lett. 12, 3 (2018), 567–583.Google ScholarGoogle ScholarCross RefCross Ref
  38. Patric R. J. Östergård. 2001. A New Algorithm for the Maximum-Weight Clique Problem. Nord. J. Comput. 8, 4 (2001), 424–436.Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Panos M. Pardalos and Nisha Desai. 1991. An Algorithm for Finding a Maximum Weighted Independent Set in an Arbitrary Graph. Int. J. Comput. Math. 38, 3-4 (1991), 163–175.Google ScholarGoogle Scholar
  40. Wayne Pullan. 2009. Optimisation of Unweighted/Weighted Maximum Independent Sets and Minimum Vertex Covers. Discret. Optim. 6, 2 (2009), 214–219.Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. Deepak Puthal, Surya Nepal, Cécile Paris, Rajiv Ranjan, and Jinjun Chen. 2015. Efficient Algorithms for Social Network Coverage and Reach. In BigData Congress 2015. 467–474.Google ScholarGoogle Scholar
  42. J.M Robson. 1986. Algorithms for Maximum Independent Sets. J. Algorithms 7, 3 (1986), 425 – 440.Google ScholarGoogle ScholarCross RefCross Ref
  43. Pedro V. Sander, Diego Nehab, Eden Chlamtac, and Hugues Hoppe. 2008. Efficient Traversal of Mesh Edges Using Adjacency Primitives. ACM Trans. Graph. 27, 5 (2008), 144.Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. Pablo San Segundo, Fabio Furini, and Jorge Artieda. 2019. A New Branch-and-Bound Algorithm for the Maximum Weighted Clique Problem. Comput. Oper. Res. 110(2019), 18–33.Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. Pablo San Segundo, Fernando Matía, Diego Rodríguez-Losada, and Miguel Hernando. 2013. An Improved Bit Parallel Exact Maximum Clique Algorithm. Optim. Lett. 7, 3 (2013), 467–479.Google ScholarGoogle ScholarCross RefCross Ref
  46. Pablo San Segundo, Diego Rodríguez-Losada, and Agustín Jiménez. 2011. An Exact Bit-Parallel Algorithm for the Maximum Clique Problem. Comput. Oper. Res. 38, 2 (2011), 571–581.Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. Hadas Shachnai and Meirav Zehavi. 2017. A Multivariate Framework for Weighted FPT Algorithms. J. Comput. Syst. Sci. 89(2017), 157–189.Google ScholarGoogle ScholarCross RefCross Ref
  48. Alok Singh and Ashok Kumar Gupta. 2006. A Hybrid Heuristic for the Minimum Weight Vertex Cover Problem. Asia Pac. J. Oper. Res. 23, 2 (2006), 273–285.Google ScholarGoogle ScholarCross RefCross Ref
  49. Robert Endre Tarjan and Anthony E. Trojanowski. 1977. Finding a Maximum Independent Set. SIAM J. Comput. 6, 3 (1977), 537–546.Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. Etsuji Tomita, Yoichi Sutani, Takanori Higashi, and Mitsuo Wakatsuki. 2013. A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments. IEICE Trans. Inf. Syst. 96-D, 6 (2013), 1286–1298.Google ScholarGoogle ScholarCross RefCross Ref
  51. René van Bevern, Matthias Mnich, Rolf Niedermeier, and Mathias Weller. 2015. Interval Scheduling and Colorful Independent Sets. J. Sched. 18, 5 (2015), 449–469.Google ScholarGoogle ScholarDigital LibraryDigital Library
  52. Magnus Wahlström. 2008. A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances. In IWPEC 2008. 202–213.Google ScholarGoogle ScholarCross RefCross Ref
  53. Limin Wang, Wenxue Du, Zhao Zhang, and Xiaoyan Zhang. 2017. A PTAS for Minimum Weighted Connected Vertex Cover P3 Problem in 3-dimensional Wireless Sensor Networks. J. Comb. Optim. 33, 1 (2017), 106–122.Google ScholarGoogle ScholarDigital LibraryDigital Library
  54. 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 ScholarGoogle Scholar
  55. 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 46, 4 (2005), 198–209.Google ScholarGoogle ScholarDigital LibraryDigital Library
  56. Mingyu Xiao and Hiroshi Nagamochi. 2013. Confining Sets and Avoiding Bottleneck Cases: A Simple Maximum Independent Set Algorithm in Degree-3 Graphs. Theor. Comput. Sci. 469(2013), 92–104.Google ScholarGoogle ScholarDigital LibraryDigital Library
  57. Mingyu Xiao and Hiroshi Nagamochi. 2017. Exact Algorithms for Maximum Independent Set. Inf. Comput. 255(2017), 126–146.Google ScholarGoogle ScholarCross RefCross Ref
  58. Cun-Quan Zhang. 1990. Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems. SIAM J. Discret. Math. 3, 3 (1990), 431–438.Google ScholarGoogle ScholarDigital LibraryDigital Library
  1. Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      WWW '21: Proceedings of the Web Conference 2021
      April 2021
      4054 pages
      ISBN:9781450383127
      DOI:10.1145/3442381

      Copyright © 2021 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 3 June 2021

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited

      Acceptance Rates

      Overall Acceptance Rate1,899of8,196submissions,23%

      Upcoming Conference

      WWW '24
      The ACM Web Conference 2024
      May 13 - 17, 2024
      Singapore , Singapore

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format .

    View HTML Format