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