Best piecewise constant approximation of a function of single variable

DOI10.1016/0167-6377(88)90030-2zbMath0658.90095OpenAlexW2077389338WikidataQ61688029 ScholiaQ61688029MaRDI QIDQ1111948

Hiroshi Konno, Takahito Kuno

Publication date: 1988

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(88)90030-2

zbMATH Keywords

shortest pathpolynomial time algorithmspiecewise constant functions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Approximation by other special function classes (41A30)

Related Items

Minimum-error classes for matching parts, Optimal nonlinear signal approximations based on piecewise constant functions, The piecewise constant/linear solution for dynamic user equilibrium, On the minimax approximation in the class of the univariate piecewise constant functions, A fractional model for locating semi-desirable facilities on networks

Cites Work

• On the approximation of curves by line segments using dynamic programming
• Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable