Sciweavers

81 search results - page 1 / 17
» Parameterized algorithmics for linear arrangement problems
Sort
View
DAM
2008
68views more  DAM 2008»
13 years 5 months ago
Parameterized algorithmics for linear arrangement problems
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for th...
Henning Fernau
CIAC
2006
Springer
69views Algorithms» more  CIAC 2006»
13 years 8 months ago
The Linear Arrangement Problem Parameterized Above Guaranteed Value
Gregory Gutin, Arash Rafiey, Stefan Szeider, Ander...
COR
2008
118views more  COR 2008»
13 years 5 months ago
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
STOC
2006
ACM
57views Algorithms» more  STOC 2006»
14 years 5 months ago
Integrality gaps for sparsest cut and minimum linear arrangement problems
Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nish...
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 4 months ago
The minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
Ilya Safro