Is Prüfer code encoding always a bad idea?

DOI10.1007/978-3-319-99648-6_5MaRDI QIDQ5234020zbMATH OpenOpenAlexFDO

Authors Hanno Hildmann, D. Y. Atia, Dymitr Ruta, A. F. Isakovic

Publication date 9 September 2019

Published in Recent Advances in Computational Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-99648-6_5

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• An encoding in metaheuristics for the minimum communication spanning tree problem
• scientific article; zbMATH DE number 1703846
• scientific article; zbMATH DE number 1735659
• The coding of binary trees
• Computing Prüfer codes efficiently in parallel

Cites work

• A Production Line that Balances Itself
• Ant colony optimization.
• Developing new locality results for the Prüfer code using a remarkable linear-time decoding algorithm
• scientific article; zbMATH DE number 1480194 (Why is no real title available?)
• scientific article; zbMATH DE number 7526262 (Why is no real title available?)
• Linear-time algorithms for encoding trees as sequences of node labels
• Modal logic
• Permutation representation of k-ary trees
• Self-organization in biological systems.
• The particle swarm optimization algorithm: Convergence analysis and parameter selection

This page was built for publication: Is Prüfer code encoding always a bad idea?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5234020)