Login / Signup
Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability.
Kevin Buchin
Maike Buchin
Jaroslaw Byrka
Martin Nöllenburg
Yoshio Okamoto
Rodrigo I. Silveira
Alexander Wolff
Published in:
Algorithmica (2012)
Keyphrases
</>
np complete
fixed parameter tractable
np hard
approximation algorithms
phase transition
special case
knowledge base
optimal solution
closed form