Connecting Two Trees with Optimal Routing Cost

Kao, Mong-Jen, Katz, Bastian, Krug, Marcus, Lee, D. T., Martin Nöllenburg, Rutter, Ignaz, Wagner, Dorothea
January 2011
PDF bib

Abstract

Full Citation:

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

Type
Conference Paper
Martin Nöllenburg
Martin Nöllenburg

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