Uniform tree approximation by global optimization techniques
From MaRDI portal
Publication:600944
DOI10.1007/S00791-009-0126-4zbMATH Open1225.41006OpenAlexW1991612213MaRDI QIDQ600944FDOQ600944
Authors: Bernardo Llanas, Francisco Javier Sáinz 
Publication date: 3 November 2010
Published in: Computing and Visualization in Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00791-009-0126-4
Recommendations
- Global numerical constraints on trees
- scientific article; zbMATH DE number 1135820
- Tree approximation and optimal encoding
- On finding most uniform spanning trees
- Near best tree approximation
- scientific article; zbMATH DE number 1263307
- Approximating Optimal Binary Decision Trees
- Approximating optimal binary decision trees
Cites Work
- Title not available (Why is that?)
- An Automatic Method of Solving Discrete Programming Problems
- Degree of Adaptive Approximation
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Introduction to global optimization
- A Local Convergence Proof for the Minvar Algorithm for Computing Continuous Piecewise Linear Approximations
- PIECEWISE-POLYNOMIAL APPROXIMATIONS OF FUNCTIONS OF THE CLASSES $ W_{p}^{\alpha}$
- Robot navigation functions on manifolds with boundary
- Legged robots
- Title not available (Why is that?)
- Fast computation in adaptive tree approximation
- Title not available (Why is that?)
- The Construction of Analytic Diffeomorphisms for Exact Robot Navigation on Star Worlds
- Asymptotically efficient triangulations of the \(d\)-cube
- Lower bounds for simplicial covers and triangulations of cubes
- Invariant Integration Formulas for the n-Simplex by Combinatorial Methods
- Error of the approximation by interpolation polynomials of small degrees on n-simplices
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
- Efficient computation of the Hausdorff distance between polytopes by exterior random covering
- The Error in Linear Interpolation at the Vertices of a Simplex
- Extended univariate algorithms for \(n\)-dimensional global optimization
- Adaptive approximation by multivariate smooth splines
- An adaptive algorithm for multivariate approximation giving optimal convergence rates
- Title not available (Why is that?)
Cited In (5)
- A tree labeling problem with an application to optimal approximation of continuous functions
- Approximation in p-norm of univariate concave functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- On min-max affine approximants of convex or concave real-valued functions from \(\mathbb{R}^k\), Chebyshev equioscillation and graphics
Uses Software
This page was built for publication: Uniform tree approximation by global optimization techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q600944)
