Multilevel algorithms for linear ordering problems

Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., n). These problems are widely used and studied in many practical and theoretical applications. In this paper we present a variety of linear-time algorithms for these problems inspired by the Algebraic Multigrid approach which is based on weighted edge contraction. The experimental result for four such problems turned out to be better than every known result in almost all cases, while the short running time of the algorithms enables testing very large graphs.

• Type: Journal
• Year: 2008
• Where: JEA
• Authors: Ilya Safro, Dorit Ron, Achi Brandt
• Keywords: Algebraic Multigrid Approach, Combinatorial Optimization Problems, JEA 2008, Problems