On the rectangularp-center problem
From MaRDI portal
Recommendations
Cited in
(48)- Continuous center problems
- Covering a set of line segments with a few squares
- The 1-center problem in the plane with independent random weights
- Rectilinear m -Center problem
- Bichromatic 2-center of pairs of points
- scientific article; zbMATH DE number 34574 (Why is no real title available?)
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
- A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
- Efficiently approximating color-spanning balls
- Polynomial algorithms for restricted Euclidean p-centre problems
- EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*
- The mixed center location problem
- A geometric characterisation of the quadratic min-power centre
- The slab dividing approach to solve the Euclidean \(P\)-center problem
- A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem
- An optimal approximation algorithm for the rectilinear m-center problem
- Analysis of facility location using ordered rectilinear distance in regular point patterns
- Optimized location of light sources to cover a rectangular region
- On weighted rectilinear 2-center and 3-center problems
- An Algorithm for the p-Center Problem in the Plane
- Efficient algorithms for computing one or two discrete centers hitting a set of line segments
- A comprehensive numerical algorithm for solving service points location problems
- A simple linear algorithm for computing rectilinear 3-centers
- Conditional p-Center Problems
- Locating an axis-parallel rectangle on a Manhattan plane
- Intersecting disks using two congruent disks
- Intersecting disks using two congruent disks
- The 1-center and 1-highway problem
- A note on the m-center problem with rectilinear distances
- scientific article; zbMATH DE number 1728311 (Why is no real title available?)
- Clustering with few disks to minimize the sum of radii
- The minimum equitable radius location problem with continuous demand
- Note on a Rectilinear Distance Round-Trip Location Problem
- The searching over separators strategy to solve some NP-hard problems in subexponential time
- On the planar piecewise quadratic 1-center problem
- scientific article; zbMATH DE number 4209906 (Why is no real title available?)
- scientific article; zbMATH DE number 1588326 (Why is no real title available?)
- Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance
- Maximizing the minimum cover probability by emergency facilities
- The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited
- Dominant, an algorithm for the \(p\)-center problem.
- Covering a set of line segments with a few squares
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems
- On the Complexity of Some Common Geometric Location Problems
- Topological stability of kinetic \(k\)-centers
- scientific article; zbMATH DE number 4141774 (Why is no real title available?)
- Discrete and mixed two-center problems for line segments
- The board packing problem
This page was built for publication: On the rectangularp-center problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4723543)
