Parameterized algorithmics for linear arrangement problems |
| |
Authors: | Henning Fernau |
| |
Affiliation: | Universität Trier, FB IV—Abteilung Informatik, 54286 Trier, Germany |
| |
Abstract: | We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for these problems. Despite this simplicity, the analysis of the algorithms is often rather intricate. For the newly introduced problem linear arrangement by deleting edges, we also show how to derive a small problem kernel. |
| |
Keywords: | Parameterized algorithms Linear arrangement problems |
本文献已被 ScienceDirect 等数据库收录! |
|