Approximate dynamic programming using halfspace queries and multiscale Monge decomposition

MaRDI QIDQ5365147zbMATH OpenFDO

Authors Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis, Gary L. Miller

Publication date 29 September 2017

Full work available at URL http://dl.acm.org/citation.cfm?id=2133165

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Recommendations

• Best piecewise constant approximation of a function of single variable
• Online Dynamic Programming Speedups
• A decomposition theorem for the least squares piecewise monotonic data approximation problem
• Approximation algorithms for speeding up dynamic programming and denoising acgh data
• Online dynamic programming speedups

Cited in

(2)

• Approximating points by a piecewise linear function
• Approximation algorithms for speeding up dynamic programming and denoising acgh data

This page was built for publication: Approximate dynamic programming using halfspace queries and multiscale Monge decomposition

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