scientific article

zbMath1274.90449MaRDI QIDQ2861498

Adam N. Letchford, Alberto Caprara, Juan-José Salazar-González

Publication date: 8 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001083

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

Lower and upper bounds for the linear arrangement problem on interval graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flow metrics
• Optimal linear labelings and eigenvalues of graphs
• Some simplified NP-complete graph problems
• Generating lower bounds for the linear arrangement problem
• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• Approximating Layout Problems on Random Geometric Graphs
• Laying Out Sparse Graphs with Provably Minimum Bandwidth
• Integrality gaps for sparsest cut and minimum linear arrangement problems
• Divide-and-conquer approximation algorithms via spreading metrics
• l²₂ spreading metrics for vertex ordering problems
• Planar linear arrangements of outerplanar graphs
• A Minimum Linear Arrangement Algorithm for Undirected Trees
• Optimal Numberings of an $N \times N$ Array
• Experiments on the minimum linear arrangement problem
• Optimal Assignments of Numbers to Vertices

This page was built for publication: