An optimal algorithm for finding all the jumps of a monotone step-function
From MaRDI portal
Publication:3723701
DOI10.1016/0196-6774(85)90043-4zbMATH Open0593.68037OpenAlexW2167621764MaRDI QIDQ3723701FDOQ3723701
Authors: Refael Hassin, Nimrod Megiddo 
Publication date: 1985
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(85)90043-4
Recommendations
- scientific article; zbMATH DE number 3974158
- On an approximation algorithm using step functions
- An optimal algorithm to find the jump number of partially ordered sets
- An optimal deciphering algorithm for some classes of monotonic functions
- An algorithm for computing estimators that optimize step functions
- An optimal single-step algorithm for maximizing doubly differentiable functions
- An approximate dynamic programming algorithm for monotone value functions
- An alogrithm for monotonic global optimization problems∗
- scientific article
- scientific article; zbMATH DE number 7079312
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) 2-person games (91A05)
Cited In (8)
- Optimal jumping patterns
- An optimal parallel algorithm for digital curve segmentation
- Optimal search for rationals
- A generalization of binary search
- Jumping Doesn’t Help in Abstract Cubes
- Searching for a monotone function by independent threshold queries
- Operations research applications of dichotomous search
- An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search
This page was built for publication: An optimal algorithm for finding all the jumps of a monotone step-function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3723701)
