Approximation Algorithms

The same group on the Doxygen site.

group Approximation Algorithms

Approximation algorithms.

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.

Classes

Class

Description

GrossoLocatelliPullanMc

Implementation of the iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem.

TomitaSekiMc

The exact maximum clique algorithm of Tomita and Seki.