A.: Drawing (complete) binary tanglegrams: Hardness, approximation, fixedparameter tractability. Arxiv report (2008)
| Citations: | 5 - 1 self |
BibTeX
@MISC{Buchin08a.:drawing,
author = {Kevin Buchin and Maike Buchin and Jaroslaw Byrka and Martin Nöllenburg and Yoshio Okamoto and Rodrigo I. Silveira and Er Wolff and Fakultät Für Informatik and Universität Karlsruhe},
title = {A.: Drawing (complete) binary tanglegrams: Hardness, approximation, fixedparameter tractability. Arxiv report},
year = {2008}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. A binary tanglegram is a pair 〈S, T 〉 of binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example in phylogenetics, it is essential that both trees are drawn without edge crossings and that the inter-tree edges have as few crossings as possible. It is known that finding a drawing with the minimum number of crossings is NP-hard and that the problem is fixed-parameter tractable with respect to that number. We prove that under the Unique Games Conjecture there is no constantfactor approximation for general binary trees. We show that the problem is hard even if both trees are complete binary trees. For this case we give an O(n 3)-time 2-approximation and a new and simple fixed-parameter algorithm. We show that the maximization version of the dual problem for general binary trees can be reduced to a version of MaxCut for which the algorithm of Goemans and Williamson yields a 0.878-approximation. 1
