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.
- Alexander A. Ageev. 1994. On Finding Critical Independent and Vertex Sets. SIAM J. Discret. Math. 7, 2 (1994), 293–295.Google ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarCross Ref
- Luitpold Babel. 1994. A Fast Algorithm for the Maximum Weight Clique Problem. Computing 52, 1 (1994), 31–38.Google ScholarCross Ref
- 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 Scholar
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarCross Ref
- Shaowei Cai and Jinkun Lin. 2016. Fast Solving Maximum Weight Clique Problem in Massive Graphs. In IJCAI 2016. 568–574.Google Scholar
- 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 ScholarCross Ref
- Shaowei Cai, Jinkun Lin, and Kaile Su. 2015. Two Weighting Local Search for Minimum Vertex Cover. In AAAI 2015. 1107–1113.Google Scholar
- 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 ScholarCross Ref
- Jianer Chen, Iyad A. Kanj, and Weijia Jia. 2001. Vertex Cover: Further Observations and Further Improvements. J. Algorithms 41, 2 (2001), 280–301.Google ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarCross Ref
- 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 ScholarDigital Library
- Henning Fernau. 2010. Parameterized Algorithms for d-Hitting Set: The Weighted Case. Theor. Comput. Sci. 411, 16-18 (2010), 1698–1713.Google ScholarDigital Library
- 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 ScholarDigital Library
- Martin Fürer and Shiva Prasad Kasiviswanathan. 2007. Algorithms for Counting 2-SAT Solutions and Colorings with Applications. In AAIM 2007. 47–57.Google ScholarDigital Library
- 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 ScholarDigital Library
- Tang Jian. 1986. An O(2Math 13) Algorithm for Solving Maximum Independent Set Problem. IEEE Trans. Computers 35, 9 (1986), 847–851.Google ScholarDigital Library
- 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 Scholar
- 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 Scholar
- 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 ScholarCross Ref
- Vedat Kavalci, Aybars Ural, and Orhan Dagdeviren. 2014. Distributed Vertex Cover Algorithms For Wireless Sensor Networks. CoRR abs/1402.2140(2014).Google Scholar
- 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 Scholar
- Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http://snap.stanford.edu/data.Google Scholar
- 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 ScholarCross Ref
- 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 ScholarCross Ref
- 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 Scholar
- 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 ScholarDigital Library
- Daniel Lokshtanov, Dániel Marx, and Saket Saurabh. 2011. Lower Bounds Based on the Exponential Time Hypothesis. Bull. EATCS 105(2011), 41–72.Google Scholar
- 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 Scholar
- Ross M. McConnell and Fabien de Montgolfier. 2005. Linear-Time Modular Decomposition of Directed Graphs. Discret. Appl. Math. 145, 2 (2005), 198–209.Google ScholarDigital Library
- Rolf Niedermeier and Peter Rossmanith. 2003. On Efficient Fixed-Parameter Algorithms for Weighted Vertex Cover. J. Algorithms 47, 2 (2003), 63–77.Google ScholarDigital Library
- 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 ScholarCross Ref
- Patric R. J. Östergård. 2001. A New Algorithm for the Maximum-Weight Clique Problem. Nord. J. Comput. 8, 4 (2001), 424–436.Google ScholarDigital Library
- 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 Scholar
- Wayne Pullan. 2009. Optimisation of Unweighted/Weighted Maximum Independent Sets and Minimum Vertex Covers. Discret. Optim. 6, 2 (2009), 214–219.Google ScholarDigital Library
- 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 Scholar
- J.M Robson. 1986. Algorithms for Maximum Independent Sets. J. Algorithms 7, 3 (1986), 425 – 440.Google ScholarCross Ref
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarCross Ref
- 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 ScholarDigital Library
- Hadas Shachnai and Meirav Zehavi. 2017. A Multivariate Framework for Weighted FPT Algorithms. J. Comput. Syst. Sci. 89(2017), 157–189.Google ScholarCross Ref
- 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 ScholarCross Ref
- Robert Endre Tarjan and Anthony E. Trojanowski. 1977. Finding a Maximum Independent Set. SIAM J. Comput. 6, 3 (1977), 537–546.Google ScholarDigital Library
- 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 ScholarCross Ref
- 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 ScholarDigital Library
- Magnus Wahlström. 2008. A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances. In IWPEC 2008. 202–213.Google ScholarCross Ref
- 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 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, 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 ScholarDigital Library
- 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 ScholarDigital Library
- Mingyu Xiao and Hiroshi Nagamochi. 2017. Exact Algorithms for Maximum Independent Set. Inf. Comput. 255(2017), 126–146.Google ScholarCross Ref
- 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 ScholarDigital Library
Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set
Recommendations
Maximum Weight Independent Sets for (P7,triangle)-free graphs in polynomial time
The Maximum Weight Independent Set (MWIS) problem on finite undirected graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum weight sum. MWIS is one of the most investigated and most important algorithmic graph problems; ...
Maximum Weighted Edge Biclique Problem on Bipartite Graphs
Algorithms and Discrete Applied MathematicsAbstractFor a graph G, a complete bipartite subgraph of G is called a biclique of G. For a weighted graph , where each edge has a weight , the Maximum Weighted Edge Biclique (MWEB) problem is to find a biclique H of G such that is maximum. The decision ...
On the maximum independent set problem in subclasses of subcubic graphs
It is known that the maximum independent set problem is NP-complete for subcubic graphs, i.e. graphs of vertex degree at most 3. Moreover, the problem is NP-complete for 3-regular Hamiltonian graphs and for H-free subcubic graphs whenever H contains a ...
Comments