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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of heuristics Jg. 18; H. 4; S. 525 - 547
Hauptverfasser:	Andrade, Diogo V., Resende, Mauricio G. C., Werneck, Renato F.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.08.2012 Springer Science + Business Media Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!