Fast local search for the maximum independent set problem

Given a graph G =( V , E ), the independent set problem is that of finding a maximum-cardinality subset S of V such that no two vertices in S are adjacent. We introduce two fast local search routines for this problem. The first can determine in linear time whether a maximal solution can be improved...

Full description

Bibliographic Details

Published in:	Journal of heuristics Vol. 18; no. 4; pp. 525 - 547
Main Authors:	Andrade, Diogo V., Resende, Mauricio G. C., Werneck, Renato F.
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.08.2012 Springer Science + Business Media Springer Nature B.V
Subjects:	Algorithms Artificial Intelligence Calculus of Variations and Optimal Control; Optimization Engineering Heuristic Management Science Mathematics Mathematics and Statistics Operations Research Operations Research/Decision Theory Studies Maximum independent set Local search Algorithm engineering Iterated local search
ISSN:	1381-1231, 1572-9397
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!