"A robust and scalable algorithm for the Steiner problem in graphs."

Thomas Pajor, Eduardo Uchoa, Renato F. Werneck (2018)
a service of Schloss Dagstuhl - Leibniz Center for Informatics