Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using GRASP

Abstract

Let G = (V, E) be an undirected graph, where V and E are the sets of vertices and edges of G, respectively. A subset of the vertices S ⊆ V is independent if all of its members are pairwise nonadjacent, i.e., have no edge between them. A solution to the NP-hard maximum independent set problem is an independent set of maximum cardinality. This article describes gmis, a set of Fortran subroutines to find an approximate solution of a maximum independent set problem. A greedy randomized adaptive search procedure (GRASP) is used to produce the solutions. The algorithm is described in detail. Implementation and usage of the package is outlined, and computational experiments are reported, illustrating solution quality as a function of running time.