Deterministic tournament selection in local search for maximum edge weight clique on large sparse graphs
MetadataShow full item record
The maximum edge weight clique (MEWC) problem is important in both theories and applications. During last decades, there has been much interest in finding optimal or near-optimal solutions to this problem. Many existing heuristics focuses on academic benchmarks of relatively small size. However, very little attention has been paid to solving the MEWC problem in large sparse graphs. In this work, we exploit the so-called deterministic tournament selection (DTS) strategy to improve the local search MEWC algorithms. Experiments conducted on a broad range of large sparse graphs show that our algorithm outperforms state-of-the-art local search algorithms in this benchmark. Moreover it finds better solutions on a list of them.
Lecture Notes in Computer Science
© 2017 Springer International Publishing AG. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. The original publication is available at www.springerlink.com.
Information and Computing Sciences not elsewhere classified