On Maximum Weight Clique Algorithms, and How They Are Evaluated

  title={On Maximum Weight Clique Algorithms, and How They Are Evaluated},
  author={Ciaran McCreesh and Patrick Prosser and Kyle Simpson and James Trimble},
Maximum weight clique and maximum weight independent set solvers are often benchmarked using maximum clique problem instances, with weights allocated to vertices by taking the vertex number mod 200 plus 1. For constraint programming approaches, this rule has clear implications, favouring weight-based rather than degree-based heuristics. We show that similar implications hold for dedicated algorithms, and that additionally, weight distributions affect whether certain inference rules are cost… 

Conflict Directed Clause Learning for Maximum Weighted Clique Problem

This work proposes an efficient implementation of Babel's bound and pruning rule, as well as a novel dominance rule, based on SAT and on the "Conflict-Driven Clause Learning" (CDCL) algorithm.

Reduction and Local Search for Weighted Graph Coloring Problem

Techniques for solving WGCP are explored, including a lower bound and a reduction rule based on clique sampling, and a local search algorithm based on two selection rules and a new variant of configuration checking, resulting in the algorithm RedLS (Reduction plus Local Search).

Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies

This work proposes two dynamic strategies that adjust the behavior of the algorithm during search, which are used to improve a state of the art local search for MWVC named FastWVC, resulting in two local search algorithms called DynW VC1 and DynWVC2.

A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs

A new method for MWCP which interleaves clique finding with data reduction rules is proposed, and an algorithm called FastWClq is developed which finds better solutions than state-of-the-art algorithms while the running time of this algorithm is much shorter than the competitors for most instances.

A Branch-and-Bound Based Exact Algorithm for the Maximum Edge-Weight Clique Problem

An exact algorithm based on branch-and-bound for the maximum edge-weight clique problem, which is NP-hard, is proposed and confirmed to be faster than the methods based on mathematical programming.

Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems

This paper explains how state of the art maximum cliques, maximum weighted clique, maximal clique enumeration and maximum common (connected) induced subgraph algorithms can be turned into certifying solvers by using pseudo-Boolean models and cutting planes proofs.

An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs

Experiments on large graphs from real-world applications show that the reduction rules are effective and the resulting BMWVC algorithm outperforms relevant exact and heuristic MWVC algorithms.

Advancing Tabu and Restart in Local Search for Maximum Weight Cliques

This paper improves the local search algorithms for solving the Maximum Weight Clique (MWC) problem by introducing new tabu and restart strategies, which outperforms several state-of-the-art solvers on the DIMACS, BHOSLIB, and two benchmarks from practical applications.



Multi-neighborhood tabu search for the maximum weight clique problem

A tabu search heuristic whose key features include a combined neighborhood and a dedicated tabu mechanism using a randomized restart strategy for diversification that outperforms the leading algorithm for the maximum weight clique problem and rivals the performance of the best methods for the unweighted version of the problem.

PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem

Local Search for Maximum Vertex Weight Clique on Large Sparse Graphs with Efficient Data Structures

This paper developed a local search MVWC solver to deal with large sparse instances, first introducing random walk into the multi-neighborhood greedy search, and implementing the algorithm with efficient data structures.

A New Algorithm for the Maximum-Weight Clique Problem

  • P. Östergård
  • Computer Science, Mathematics
    Electron. Notes Discret. Math.
  • 1999

Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems

A filtering algorithm for this property is introduced and it is shown that it may be combined with a restricted branching technique for the constraint-based approach and how to implement a similar branching technique in clique-inspired algorithms is shown.

Fast Solving Maximum Weight Clique Problem in Massive Graphs

A new method for MWCP which interleaves between clique construction and graph reduction is proposed, and an algorithm called FastWClq is developed which proves the optimal solution for about half of the graphs in an averaged time less than one second.

Breakout Local Search for maximum clique problems

Solving the maximum edge-weight clique problem in sparse graphs with compact formulations

This paper proposes new node-discretized formulations for the maximum edge-weight clique problem in sparse graphs, which are more compact than other models known from the literature and address a new variant of the MEWC problem where the objective to be maximized includes the neighboring edges of the clique.

An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem

This paper applies MaxSAT reasoning to compute a tight upper bound for a Maximum Weight Clique (MWC) of a wighted graph and implements a branch-and-bound algorithm called MWCLQ, which outperforms state-of-the-art exact algorithms on the vast majority of instances.

Two Efficient Local Search Algorithms for Maximum Weight Clique Problem

Two heuristics called strong configuration checking (SCC) and Best from Multiple Selection (BMS) are introduced and two local search algorithms for MWCP are developed, which outperform the state-of-the-art local search algorithm MN/TS and its improved version MN/ TS+BMS on the standard benchmarks.