Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

DAM
2008

favoriteEmaildiscussreport

68views more DAM 2008»

Parameterized algorithmics for linear arrangement problems

13 years 4 months ago

Parameterized algorithmics for linear arrangement problems

Download www.informatik.uni-trier.de

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. However, the analysis of these algorithms is sometimes not so easy. Key words: Parameterized algorithms, linear arrangement problems

Henning Fernau

Real-time Traffic

DAM 2008 | Linear Arrangement | Problems | Simple Search Tree |

claim paper

Related Content

» The Linear Arrangement Problem Parameterized Above Guaranteed Value

» An effective twostage simulated annealing algorithm for the minimum linear arrangement pro...

» Integrality gaps for sparsest cut and minimum linear arrangement problems

» The minimum linear arrangement problem on proper interval graphs

» An improved approximation ratio for the minimum linear arrangement problem

» A Comparison of Memetic Recombination Operators for the MinLA Problem

» Shape fitting with outliers

» Algorithmic Lower Bounds for Problems Parameterized by Cliquewidth

» Minimumcost sensor arrangement for achieving wanted coverage lifetime

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DAM
Authors	Henning Fernau

Comments (0)