DocumentCode
130378
Title
Exact and approximation algorithms for Linear Arrangement Problems
Author
Quilliot, Alain ; Rebaine, Djamal
Author_Institution
LABEX IMOBS3, Univ. Blaise Pascal, Aubiere, France
fYear
2014
fDate
7-10 Sept. 2014
Firstpage
493
Lastpage
500
Abstract
We present here new results and algorithms for the Linear Arrangement Problem (LAP). We first propose a new lower bound, which links LAP with the Max Cut Problem, and derive a LIP model as well as a branch/bound algorithm for the general case. Then we focus on the case of interval graphs: we first show that our lower bound is tight for unit interval graphs, and derive an efficient polynomial time approximation algorithm for general interval graphs.
Keywords
approximation theory; computational complexity; graph theory; tree searching; LAP; branch-bound algorithm; exact algorithm; interval graphs; linear arrangement problems; max cut problem; polynomial time approximation algorithm; Algorithm design and analysis; Approximation algorithms; Approximation methods; Extremities; Polynomials; Semantics; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Systems (FedCSIS), 2014 Federated Conference on
Conference_Location
Warsaw
Type
conf
DOI
10.15439/2014F50
Filename
6933056
Link To Document