Deterministic tournament selection in local search for maximum edge weight clique on large sparse graphs

Loading...
Thumbnail Image
File version
Accepted Manuscript (AM)
Author(s)
Ma, Z
Fan, Y
Su, K
Li, C
Sattar, A
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2017
Size
File type(s)
Location
License
Abstract

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.

Journal Title
Lecture Notes in Computer Science
Conference Title
Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
© 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.
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject
Other information and computing sciences not elsewhere classified
Information and computing sciences
Persistent link to this record
Citation
Collections