abLEMON 1.9.0-101-gccb8629
A maintained fork of LEMON
Loading...
Searching...
No Matches
Approximation Algorithms

Approximation algorithms. More...

Files

file  grosso_locatelli_pullan_mc.h
 The iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem.
file  tomita_seki_mc.h

Classes

class  GrossoLocatelliPullanMc< GR >
 Implementation of the iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem. More...
class  TomitaSekiMc< GR >
 The exact maximum clique algorithm of Tomita and Seki. More...

Detailed Description

This group contains the approximation and heuristic algorithms implemented in LEMON, and the exact algorithm for the maximum clique problem next to its heuristic.

Maximum Clique Problem

  • GrossoLocatelliPullanMc An efficient heuristic algorithm of Grosso, Locatelli, and Pullan.
  • TomitaSekiMc The exact branch and bound algorithm of Tomita and Seki, which proves the clique it finds maximum.