Pages that link to "Item:Q3837388"
From MaRDI portal
The following pages link to On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension (Q3837388):
Displaying 46 items.
- Minimum enclosing circle of a set of fixed points and a mobile point (Q396467) (← links)
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
- Covering points by disjoint boxes with outliers (Q617548) (← links)
- A streaming algorithm for 2-center with outliers in high dimensions (Q680151) (← links)
- Improved algorithms for the bichromatic two-center problem for pairs of points (Q824325) (← links)
- Approximate aggregation for tracking quantiles and range countings in wireless sensor networks (Q896119) (← links)
- Unique sink orientations of grids (Q930596) (← links)
- Violator spaces: Structure and algorithms (Q943850) (← links)
- Improved algorithms via approximations of probability distributions (Q1582012) (← links)
- Ham-sandwich cuts for abstract order types (Q1702128) (← links)
- Optimizing squares covering a set of points (Q1749537) (← links)
- The 2-center problem in three dimensions (Q1947989) (← links)
- Stabbing pairwise intersecting disks by five points (Q2032723) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
- Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints (Q2181246) (← links)
- Near-optimal coresets of kernel density estimates (Q2189735) (← links)
- Bichromatic 2-center of pairs of points (Q2261579) (← links)
- Largest bounding box, smallest diameter, and related problems on imprecise points (Q2269143) (← links)
- Approximate range searching: The absolute model (Q2269144) (← links)
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points (Q2304571) (← links)
- The complexity of optimization on grids (Q2319631) (← links)
- Computing a geodesic two-center of points in a simple polygon (Q2331214) (← links)
- Streaming algorithms for extent problems in high dimensions (Q2345940) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS (Q2708040) (← links)
- Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints (Q2795940) (← links)
- Deterministic Algorithms for Unique Sink Orientations of Grids (Q2817878) (← links)
- Subsampling in Smoothed Range Spaces (Q2835631) (← links)
- COMPUTING <i>k</i> CENTERS OVER STREAMING DATA FOR SMALL <i>k</i> (Q2939917) (← links)
- Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls (Q2948466) (← links)
- A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids (Q2958363) (← links)
- Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point (Q3078388) (← links)
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING (Q3647614) (← links)
- Approximate Polytope Membership Queries (Q4600697) (← links)
- Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function (Q4632168) (← links)
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS (Q4818546) (← links)
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS (Q4824662) (← links)
- (Q5009560) (← links)
- (Q5009629) (← links)
- (Q5091042) (← links)
- Economical Delone Sets for Approximating Convex Bodies (Q5116467) (← links)
- (Q5116526) (← links)
- Simple linear time algorithms for piercing pairwise intersecting disks (Q6110069) (← links)
- Stabbing pairwise intersecting disks by four points (Q6142366) (← links)
- (Q6179337) (← links)
