Approximation algorithms for maximum linear arrangement

DOI10.1016/S0020-0190(01)00159-4zbMath1032.68159OpenAlexW2060236550MaRDI QIDQ1603380

Refael Hassin, Shlomi Rubinstein

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00159-4

zbMATH Keywords

AlgorithmsAlgorithmical approximation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (2)

The maximum linear arrangement problem for trees under projectivity and planarity ⋮ Bounds of the sum of edge lengths in linear arrangements of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the maximum quadratic assignment problem
• Using Homogeneous Weights for Approximating the Partial Cover Problem
• Divide-and-conquer approximation algorithms via spreading metrics
• Obnoxious Facility Location on Graphs
• A Cut Approach to the Rectilinear Distance Facility Location Problem
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

This page was built for publication: Approximation algorithms for maximum linear arrangement