(1, k)-Swap Local Search for Maximum Clique Problem
Optimization and Control
2017-04-05 v1 Data Structures and Algorithms
Abstract
Given simple undirected graph G = (V, E), the Maximum Clique Problem(MCP) is that of finding a maximum-cardinality subset Q of V such that any two vertices in Q are adjacent. We present a modified local search algorithm for this problem. Our algorithm build some maximal solution and can determine in polynomial time if a maximal solution can be improved by replacing a single vertex with k, k > 1, others. We test our algorithms on DIMACS[5], Sloane[15], BHOSLIB[1], Iovanella[8] and our random instances.
Cite
@article{arxiv.1704.00908,
title = {(1, k)-Swap Local Search for Maximum Clique Problem},
author = {Lavnikevich Nikolay},
journal= {arXiv preprint arXiv:1704.00908},
year = {2017}
}
Comments
14 pages, 17 references