A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree

Eunjin Oh 0001, Hee-Kap Ahn. A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree. In Seok-Hee Hong, editor, 27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia. Volume 64 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

Abstract

Abstract is missing.