Greedy randomized adaptive search procedures for the Steiner problem in graphs

Simone L. Martins, Panos M. Pardalos, Mauricio G. C. Resende, Celso C. Ribeiro. Greedy randomized adaptive search procedures for the Steiner problem in graphs. In Panos M. Pardalos, Sanguthevar Rajasekaran, José Rolim, editors, Randomization Methods in Algorithm Design, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, December 12-14, 1997. Volume 43 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 133-146, DIMACS/AMS, 1997.

Abstract

Abstract is missing.