A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Martin Berlakovich, Mario Ruthmair, Günther R. Raidl. A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, editors, Computer Aided Systems Theory - EUROCAST 2011 - 13th International Conference, Las Palmas de Gran Canaria, Spain, February 6-11, 2011, Revised Selected Papers, Part I. Volume 6927 of Lecture Notes in Computer Science, pages 256-263, Springer, 2011. [doi]

This author has not been identified. Look up 'Martin Berlakovich' in GoogleThis author has not been identified. Look up 'Mario Ruthmair' in GoogleThis author has not been identified. Look up 'Günther R. Raidl' in Google

runs on WebDSL