Connecting Two Trees with Optimal Routing Cost

Abstract

Full Citation:

Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner. Connecting Two Trees with Optimal Routing Cost. Canadian Conference on Computational Geometry (CCCG ‘11), pages 43–47, 2011, University of Toronto.

Martin Nöllenburg

Martin Nöllenburg is a Professor at the Algorithms and Complexity Group.