On the rectangularp-center problem
From MaRDI portal
Publication:4723543
DOI<229::AID-NAV3220340207>3.0.CO;2-1 10.1002/1520-6750(198704)34:2<229::AID-NAV3220340207>3.0.CO;2-1zbMath0614.90034OpenAlexW2158468450MaRDI QIDQ4723543
Publication date: 1987
Full work available at URL: https://doi.org/10.1002/1520-6750(198704)34:2<229::aid-nav3220340207>3.0.co;2-1
Related Items (31)
The searching over separators strategy to solve some NP-hard problems in subexponential time ⋮ Efficiently approximating color-spanning balls ⋮ The minimum equitable radius location problem with continuous demand ⋮ Optimized location of light sources to cover a rectangular region ⋮ Topological stability of kinetic \(k\)-centers ⋮ Unnamed Item ⋮ Discrete and mixed two-center problems for line segments ⋮ Efficient algorithms for computing one or two discrete centers hitting a set of line segments ⋮ The board packing problem ⋮ An optimal approximation algorithm for the rectilinear m-center problem ⋮ The 1-center problem in the plane with independent random weights ⋮ The 1-Center and 1-Highway Problem ⋮ Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares ⋮ The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited ⋮ Maximizing the minimum cover probability by emergency facilities ⋮ EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS* ⋮ 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 simple linear algorithm for computing rectilinear 3-centers ⋮ Rectilinear m -Center problem ⋮ Bichromatic 2-center of pairs of points ⋮ A comprehensive numerical algorithm for solving service points location problems ⋮ Intersecting disks using two congruent disks ⋮ A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane ⋮ Intersecting disks using two congruent disks ⋮ On weighted rectilinear 2-center and 3-center problems ⋮ Covering a set of line segments with a few squares ⋮ Covering a set of line segments with a few squares ⋮ A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem ⋮ \(L_1\) geodesic farthest neighbors in a simple polygon and related problems ⋮ Continuous Center Problems
Cites Work
This page was built for publication: On the rectangularp-center problem
