Results 1  10
of
1,669,221
Experiments on the Minimum Linear Arrangement Problem
 Sistemes Informàtics, 2001. (Preliminary version in Alex ’98 — Building Bridges between Theory and Applications
, 2001
"... This paper deals with the Minimum Linear Arrangement problem from an experimental point of view. Using a testsuite of sparse graphs, we experimentally compare several algorithms to obtain upper and lower bounds for this problem. The algorithms considered include Successive Augmentation heuristics, ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
This paper deals with the Minimum Linear Arrangement problem from an experimental point of view. Using a testsuite of sparse graphs, we experimentally compare several algorithms to obtain upper and lower bounds for this problem. The algorithms considered include Successive Augmentation heuristics
Heuristics for the Minimum Linear Arrangement Problem
"... The linear arrangement minimization problem consists of finding a labeling or arrangement of the vertices of a graph that minimizes the sum of the absolute values of the differences between the labels of adjacent vertices. This is a wellknown NPhard problem that presents a challenge to solution me ..."
Abstract
 Add to MetaCart
The linear arrangement minimization problem consists of finding a labeling or arrangement of the vertices of a graph that minimizes the sum of the absolute values of the differences between the labels of adjacent vertices. This is a wellknown NPhard problem that presents a challenge to solution
Tractable Parameterizations for the Minimum Linear Arrangement Problem
"... The Minimum Linear Arrangement (MLA) problem asks to embed a given graph on the integer line so that the sum of the edge lengths of the embedded graph is minimized. Most layout problems are either intractable, or not known to be tractable, parameterized by the treewidth of the input graphs. We inv ..."
Abstract
 Add to MetaCart
The Minimum Linear Arrangement (MLA) problem asks to embed a given graph on the integer line so that the sum of the edge lengths of the embedded graph is minimized. Most layout problems are either intractable, or not known to be tractable, parameterized by the treewidth of the input graphs. We
Minimum Linear Arrangement of SeriesParallel Graphs∗
"... We present a factor 14D2 approximation algorithm for the minimum linear arrangement problem on seriesparallel graphs, where D is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time O(E) and is very easy to implement. Its divideandconquer ap ..."
Abstract
 Add to MetaCart
We present a factor 14D2 approximation algorithm for the minimum linear arrangement problem on seriesparallel graphs, where D is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time O(E) and is very easy to implement. Its divide
Graph Minimum Linear Arrangement by Multilevel Weighted Edge Contractions
, 2006
"... The minimum linear arrangement problem is widely used and studied in many practical and theoretical applications. In this paper we present a lineartime algorithm for the problem inspired by the algebraic multigrid approach which is based on weighted edge contraction rather than simple contraction. ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
The minimum linear arrangement problem is widely used and studied in many practical and theoretical applications. In this paper we present a lineartime algorithm for the problem inspired by the algebraic multigrid approach which is based on weighted edge contraction rather than simple contraction
INAPPROXIMABILITY RESULTS FOR MAXIMUM EDGE BICLIQUE, MINIMUM LINEAR ARRANGEMENT, AND SPARSEST CUT
, 2011
"... We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NPhard graph problems have resisted all attempts to prove inapproximability results. We show that they have no polynomial time approximation scheme, unless NPcomplete problems ca ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NPhard graph problems have resisted all attempts to prove inapproximability results. We show that they have no polynomial time approximation scheme, unless NPcomplete problems
Decorous lower bounds for minimum linear arrangement. Working paper
, 2009
"... Minimum Linear Arrangement is a classical basic combinatorial optimization problem from the 1960s, which turns out to be extremely challenging in practice. In particular, for most of its benchmark instances, even the order of magnitude of the optimal solution value is unknown, as testified by the su ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Minimum Linear Arrangement is a classical basic combinatorial optimization problem from the 1960s, which turns out to be extremely challenging in practice. In particular, for most of its benchmark instances, even the order of magnitude of the optimal solution value is unknown, as testified
Integrality gaps for sparsest cut and minimum linear arrangement problems
 In STOC ’06: Proceedings of the thirtyeighth annual ACM symposium on Theory of computing
, 2006
"... Arora, Rao and Vazirani [2] showed that the standard semidefinite programming (SDP) relaxation of the Sparsest Cut problem with the triangle inequality constraints has an integrality gap of O( log n). They conjectured that the gap is bounded from above by a constant. In this paper, we disprove thi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
) integrality gap instance for the SDP relaxation of the Minimum Linear Arrangement problem. This SDP relaxation was considered in [6, 10], where it was shown that its integrality gap is bounded from above by O( log n log log n).
An Effective TwoStage Simulated Annealing Algorithm for the Minimum Linear Arrangement Problem Abstract
"... In this paper, an improved TwoStage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguished features including an efficient heuristic to generate good quality initial solutions, a highly discriminating evaluat ..."
Abstract
 Add to MetaCart
In this paper, an improved TwoStage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguished features including an efficient heuristic to generate good quality initial solutions, a highly discriminating
Results 1  10
of
1,669,221