Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

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

From MaRDI portal
Publication:2435909
Jump to:navigation, search

DOI10.1134/S0001434612010038zbMATH Open1282.05192MaRDI QIDQ2435909FDOQ2435909


Authors: Vladimir V. Galatenko Edit this on Wikidata


Publication date: 21 February 2014

Published in: Mathematical Notes (Search for Journal in Brave)





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


zbMATH Keywords

labelingcomplexityfunction approximation\(n\)-term approximationsignal discretization


Mathematics Subject Classification ID

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


Cites Work

  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • Nonlinear methods of approximation
  • Title not available (Why is that?)
  • Fast computation in adaptive tree approximation
  • Title not available (Why is that?)






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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2435909&oldid=15109120"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 2 February 2024, at 22:38. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki