Local Monotonicity Reconstruction
From MaRDI portal
Publication:5390580
DOI10.1137/080728561zbMath1213.68420OpenAlexW2069947312MaRDI QIDQ5390580
Publication date: 4 April 2011
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8a51872d52574bab9a32b7e77cead9ba39ffb464
Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (12)
Sampling Correctors ⋮ Can we locally compute sparse connected subgraphs? ⋮ Steiner transitive-closure spanners of low-dimensional posets ⋮ Unnamed Item ⋮ Constructing near spanning trees with few local inspections ⋮ Steiner Transitive-Closure Spanners of Low-Dimensional Posets ⋮ Approximating convex functions via non-convex oracles under the relative noise model ⋮ Local computation algorithms for graphs of non-constant degrees ⋮ Local Property Reconstruction and Monotonicity ⋮ Limitations of Local Filters of Lipschitz and Monotone Functions ⋮ Local algorithms for sparse spanning graphs ⋮ Unnamed Item
This page was built for publication: Local Monotonicity Reconstruction
