Heuristics for the data arrangement problem on regular trees

DOI10.1007/s10878-013-9666-0zbMath1332.90222arXiv1304.5942OpenAlexW2015739999MaRDI QIDQ498454

Eranda Çela, Rostislav Staněk

Publication date: 28 September 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.5942

zbMATH Keywords

heuristicsregular treescombinatorial optimisationdata arrangement problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• On optimal linear arrangements of trees
• Optimal linear labelings and eigenvalues of graphs
• A genetic algorithm for the weight setting problem in OSPF routing
• On cutting a few vertices from a graph
• A Minimum Linear Arrangement Algorithm for Undirected Trees
• Experiments on the minimum linear arrangement problem

This page was built for publication: Heuristics for the data arrangement problem on regular trees