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
(61)- Improved algorithms for the bichromatic two-center problem for pairs of points
- The complexity of optimization on grids
- Minimum enclosing circle of a set of fixed points and a mobile point
- Linear Optimization Queries
- Subquadratic algorithms for algebraic 3SUM
- Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints
- 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
- Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions
- Bichromatic 2-center of pairs of points
- Locked and unlocked smooth embeddings of surfaces
- Improved algorithms via approximations of probability distributions
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs
- Stabbing pairwise intersecting disks by four points
- A randomized algorithm for fixed-dimensional linear programming
- Optimizing squares covering a set of points
- A decision procedure for linear ``big O equations
- Approximate polytope membership queries
- Deterministic fault-tolerant connectivity labeling scheme
- Economical Delone sets for approximating convex bodies
- Stabbing pairwise intersecting disks by five points
- Approximate convex intersection detection with applications to width and Minkowski sums
- Violator spaces: Structure and algorithms
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points
- Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls
- Optimal algorithm for the planar two-center problem
- Minimum enclosing circle of a set of fixed points and a mobile point
- Subsampling in smoothed range spaces
- The k-center problem of uncertain points on graphs
- scientific article; zbMATH DE number 7378732 (Why is no real title available?)
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
- scientific article; zbMATH DE number 4161540 (Why is no real title available?)
- Unique sink orientations of grids
- A Deterministic ${\operatorname{Poly}}(\log \log N)$-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension
- Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function
- Approximate aggregation for tracking quantiles and range countings in wireless sensor networks
- Improved deterministic algorithms for linear programming in low dimensions
- Improved deterministic algorithms for linear programming in low dimensions
- scientific article; zbMATH DE number 7561404 (Why is no real title available?)
- Approximate range searching: The absolute model
- The \(\varepsilon\)-\(t\)-net problem
- Deterministic Fault-Tolerant Connectivity Labeling Scheme
- Near-optimal coresets of kernel density estimates
- Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems
- The 2-center problem in three dimensions
- Simple linear time algorithms for piercing pairwise intersecting disks
- Optimal algorithm for the planar two-center problem
- An optimal and practical algorithm for the planar 2-center problem
- Computing k centers over streaming data for small k
- Near-optimal coresets of kernel density estimates
- scientific article; zbMATH DE number 4141416 (Why is no real title available?)
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
- Streaming algorithms for extent problems in high dimensions
- Covering points by disjoint boxes with outliers
- Deterministic algorithms for unique sink orientations of grids
- On the planar two-center problem and circular hulls
- A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids
- scientific article; zbMATH DE number 437553 (Why is no real title available?)
- A streaming algorithm for 2-center with outliers in high dimensions
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)
