Assigning weights to minimize the covering radius in the plane
From MaRDI portal
Publication:2331208
Recommendations
- Assigning weights to minimize the covering radius in the plane
- scientific article; zbMATH DE number 742947
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
- A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
- On a circle-cover minimization problem
- scientific article; zbMATH DE number 3966112
- scientific article; zbMATH DE number 1253058
- The reductions for the approximating covering radius problem
- An optimal polynomial for a covering radius problem
- Using homogeneous weights for approximating the partial cover problem
Cites work
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
- Improving the location of minimax facilities through network modification
- Inverse 1-center location problems with edge length augmentation on trees
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- On the ball spanned by balls
- Parallel Merge Sort
- Some reverse location problems
- The complexity analysis of the inverse center location problem
- Weight Balancing on Boundaries and Skeletons
Cited in
(2)
This page was built for publication: Assigning weights to minimize the covering radius in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331208)
