It is suggested here a fast and easy to implement heuristic for the minimization of open stacks problem (MOSP). The problem is modeled as a traversing problem in a graph (G mosp ) with a special structure (Yanasse, 1997b). It was observed in Ashikaga (2001) that, in the mean experimental case, G mosp has large cliques and high edge density. This information was used to implement a heuristic based on the extension-rotation algorithm of Pósa (1976) for approximation of Hamiltonian Circuits. Additionally, an initial path for Pósa's algorithm is derived from the vertices of an ideally maximum clique in order to accelerate the process. Extensive computational tests show that the resulting simple approach dominates in time and mean error the fast actually know Yuen (1991 and heuristic to the problem.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.