On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 437553
- Improved deterministic algorithms for linear programming in low dimensions
- Improved deterministic algorithms for linear programming in low dimensions
- scientific article; zbMATH DE number 139625
- scientific article; zbMATH DE number 23916
- A space decomposition-based deterministic algorithm for solving linear optimization problems
- scientific article; zbMATH DE number 4161540
- A Deterministic ${\operatorname{Poly}}(\log \log N)$-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension
- scientific article; zbMATH DE number 3990208
- Linear Programming in Linear Time When the Dimension Is Fixed
Cited in
(64)- Improved algorithms via approximations of probability distributions
- Optimizing squares covering a set of points
- A randomized algorithm for fixed-dimensional linear programming
- The 2-center problem in three dimensions
- Stabbing pairwise intersecting disks by five points
- On the planar two-center problem and circular hulls
- The \(\varepsilon\)-\(t\)-net problem
- Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints
- Near-optimal coresets of kernel density estimates
- Bichromatic 2-center of pairs of points
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Approximate range searching: The absolute model
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points
- The complexity of optimization on grids
- Streaming algorithms for extent problems in high dimensions
- Subquadratic algorithms for algebraic 3SUM
- A decision procedure for linear ``big O equations
- Quantile approximation for robust statistical estimation and \(k\)-enclosing problems
- Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints
- Deterministic algorithms for unique sink orientations of grids
- Subsampling in smoothed range spaces
- Computing k centers over streaming data for small k
- Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls
- A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids
- Minimum enclosing circle of a set of fixed points and a mobile point
- scientific article; zbMATH DE number 437553 (Why is no real title available?)
- scientific article; zbMATH DE number 4141416 (Why is no real title available?)
- scientific article; zbMATH DE number 4161540 (Why is no real title available?)
- Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
- Minimum enclosing circle of a set of fixed points and a mobile point
- Improved deterministic algorithms for linear programming in low dimensions
- Improved deterministic algorithms for linear programming in low dimensions
- Approximate polytope membership queries
- Linear time algorithm for 1-center in \(\mathfrak {R}^d\) under convex polyhedral distance function
- Linear Optimization Queries
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
- Approximate convex intersection detection with applications to width and Minkowski sums
- Practical low-dimensional halfspace range space sampling
- Stabbing pairwise intersecting disks by five points
- Economical Delone sets for approximating convex bodies
- Near-optimal coresets of kernel density estimates
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs
- A Deterministic ${\operatorname{Poly}}(\log \log N)$-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension
- Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions
- Simple linear time algorithms for piercing pairwise intersecting disks
- Stabbing pairwise intersecting disks by four points
- Covering points by disjoint boxes with outliers
- Locked and unlocked smooth embeddings of surfaces
- Deterministic Fault-Tolerant Connectivity Labeling Scheme
- A streaming algorithm for 2-center with outliers in high dimensions
- Optimal algorithm for the planar two-center problem
- An optimal and practical algorithm for the planar 2-center problem
- Deterministic fault-tolerant connectivity labeling scheme
- Optimal algorithm for the planar two-center problem
- The k-center problem of uncertain points on graphs
- A space-partition based approach to the 2-center problem in three and higher dimensions
- Hitting and covering affine families of convex polyhedra, with applications to robust optimization
- Support vector machines in the Hilbert geometry
- Improved algorithms for the bichromatic two-center problem for pairs of points
- Approximate aggregation for tracking quantiles and range countings in wireless sensor networks
- Unique sink orientations of grids
- Violator spaces: Structure and algorithms
This page was built for publication: On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3837388)
