SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem

Wang, Yiyuan; Cai, Shaowei; Chen, Jiejiang; Yin, Minghao

doi:10.1016/j.artint.2019.103230

Cited by 62 publications

(58 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…本小节主要介绍将消元法 (decimation algorithm) [19] 和局部搜索算法 (local search algorithm) [20] 应用于求解 PMS 问题的算法: DeciDist 算法. 该算法对 Dist 算法进行了改进, 对于 MSEs 的 PMS 实例表现出较高的求解效率.…”

Section: Decidist 算法的主要思想unclassified

Partial maximum satisfiability problem method combined with structure characteristics for diagnostic problems

et al. 2019

View full text Add to dashboard Cite

show abstract

Section: Decidist 算法的主要思想unclassified

Partial maximum satisfiability problem method combined with structure characteristics for diagnostic problems

et al. 2019

View full text Add to dashboard Cite

show abstract

“…However, the greedy strategy usually also makes the local search algorithms easier to fall into the cycling problem (which means the algorithm visits the same part of the solution space repeatedly). Up to now, many efficient strategies have been used to handle this problem [17][18][19][20]. Configuration checking ( ) [21] strategy is one of those strategies and has been applied to some problems successfully [21][22][23][24][25].…”

Section: Configuration Checking Strategymentioning

confidence: 99%

An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem

Zhang

et al. 2018

Mathematical Problems in Engineering

Self Cite

View full text Add to dashboard Cite

The connected vertex cover (CVC) problem, which has many important applications, is a variant of the vertex cover problem, such as wireless network design, routing, and wavelength assignment problem. A good algorithm for the problem can help us improve engineering efficiency, cost savings, and resources consumption in industrial applications. In this work, we present an efficient algorithm GRASP-CVC (Greedy Randomized Adaptive Search Procedure for Connected Vertex Cover) for CVC in general graphs. The algorithm has two main phases, i.e., construction phase and local search phase. In the construction phase, to construct a high quality feasible initial solution, we design a greedy function and a restricted candidate list. In the local search phase, the configuration checking strategy is adopted to decrease the cycling problem. The experimental results demonstrate that GRASP-CVC is better than other comparison algorithms in terms of effectivity and efficiency.

show abstract

“…Heuristic algorithms all differ in accuracy, speed, and they often use specific properties of graphs. One of the currently best heuristic methods is LSCC+BMS, proposed in the paper [18].…”

Section: Introductionmentioning

confidence: 99%

Testing a Heuristic Algorithm for Finding a Maximum Clique on DIMACS and Facebook Graphs

Balash

Stepanova

Volkov

et al. 2020

Wseas Transactions on Systems and Control

View full text Add to dashboard Cite

In this paper we propose a new heuristic algorithm for solving a maximum clique search problem (MCP). While the proposed algorithm (called TrustCLQ) uses a general approach to solving MCP, it is almost independent of the order of vertices and does not exploit a partition of the graph into independent sets. The algorithm was tested on DIMACS library graphs which are often employed for testing MCP solution algorithms. TrustCLQ algorithm was compared with the well-known ILS heuristic algorithm (as well as with a standard algorithm from networkx library) on DIMACS data sets. Moreover, TrustCLQ algorithm has been tested on Facebook social graphs

show abstract

SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem

Cited by 62 publications

References 34 publications

Partial maximum satisfiability problem method combined with structure characteristics for diagnostic problems

Partial maximum satisfiability problem method combined with structure characteristics for diagnostic problems

An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem

Testing a Heuristic Algorithm for Finding a Maximum Clique on DIMACS and Facebook Graphs

Contact Info

Product

Resources

About