An Augmentation Algorithm for the Maximum Weighted Stable Set Problem

Authors:
Carlo Mannino;Egidio Stefanutti
Affiliations:
Dipartimento di Informatica e Sistemistica, Università di Roma La Sapienza, Via Buonarroti 12, 00185 Roma. mannino@dis.uniroma1.it;Dipartimento di Informatica e Sistemistica, Università di Roma La Sapienza, Via Buonarroti 12, 00185 Roma
Venue:
Computational Optimization and Applications
Year:
1999

Citing 11
Cited 2

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Finding a maximum clique in an arbitrary graph

SIAM Journal on Computing
Stabulus: a technique for finding stable sets in large graphs with tabu search

Computing
TABARIS: an exact algorithm based on Tabu Search for finding a maximum independent set in a graph

Computers and Operations Research
Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs

SIAM Journal on Computing
Finding maximum cliques in arbitrary and in special graphs

Computing
Stability number of bull- and chair-free graphs

Discrete Applied Mathematics
An exact algorithm for the maximum stable set problem

Computational Optimization and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Branch and Bound Algorithm for the Stability Number of a Sparse Graph

INFORMS Journal on Computing
Fast algorithms for vertex packing and related problems

Fast algorithms for vertex packing and related problems

Struction revisited

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
A new trust region technique for the maximum weight clique problem

Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02

Quantified Score

Hi-index	0.00

Visualization

Abstract

Edge projection is a specialization of Lovász andPlummer‘s clique reduction when restricted to edges. Aconcept of augmenting sequences of edge-projections isdefined w.r.t. a stable set S. It is then proved theequivalence between the optimality of S and theexistence of an augmenting sequence w.r.t. S. Thisresult is then exploited to develop a new tabu-searchheuristic for the Maximum Stable SetProblem (weighted and unweighted). The resulting codeproved to be competitive with the best codes presented inthe literature.