On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
From MaRDI portal
Publication:3837388
DOI10.1006/jagm.1996.0060zbMath0864.68040MaRDI QIDQ3837388
Bernard Chazelle, Ji{ří} Matoušek
Publication date: 8 July 1997
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1996.0060
68W10: Parallel algorithms in computer science
Related Items
APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS, THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS, Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs, Covering points by disjoint boxes with outliers, Unique sink orientations of grids, Violator spaces: Structure and algorithms, Improved algorithms via approximations of probability distributions, The 2-center problem in three dimensions, Largest bounding box, smallest diameter, and related problems on imprecise points, Approximate range searching: The absolute model, QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS, Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point, APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
