A tree labeling problem with an application to optimal approximation of continuous functions

DOI10.1134/S0001434612010038MaRDI QIDQ2435909zbMATH OpenFDO

Authors Vladimir V. Galatenko

Publication date 21 February 2014

Published in Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

labelingcomplexityfunction approximation\(n\)-term approximationsignal discretization

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Uniform tree approximation by global optimization techniques
• The Profile Minimization Problem in Trees
• Near best tree approximation
• scientific article; zbMATH DE number 7364985
• scientific article; zbMATH DE number 4047157

Cites work

• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• scientific article; zbMATH DE number 1215245 (Why is no real title available?)
• scientific article; zbMATH DE number 194515 (Why is no real title available?)
• Fast computation in adaptive tree approximation
• Nonlinear methods of approximation

This page was built for publication: A tree labeling problem with an application to optimal approximation of continuous functions

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