Pages that link to "Item:Q4723543"
From MaRDI portal
The following pages link to On the rectangularp-center problem (Q4723543):
Displaying 31 items.
- Efficiently approximating color-spanning balls (Q284593) (← links)
- The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited (Q512987) (← links)
- Maximizing the minimum cover probability by emergency facilities (Q512997) (← links)
- On weighted rectilinear 2-center and 3-center problems (Q757236) (← links)
- An optimal approximation algorithm for the rectilinear m-center problem (Q911284) (← links)
- A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane (Q1007585) (← links)
- The slab dividing approach to solve the Euclidean \(P\)-center problem (Q1207325) (← links)
- Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance (Q1208455) (← links)
- A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem (Q1291662) (← links)
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← links)
- Optimized location of light sources to cover a rectangular region (Q2155145) (← links)
- Bichromatic 2-center of pairs of points (Q2261579) (← links)
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems (Q2334499) (← links)
- The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228) (← links)
- The minimum equitable radius location problem with continuous demand (Q2378371) (← links)
- Efficient algorithms for computing one or two discrete centers hitting a set of line segments (Q2424732) (← links)
- The 1-center problem in the plane with independent random weights (Q2456633) (← links)
- A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
- A comprehensive numerical algorithm for solving service points location problems (Q2493748) (← links)
- Topological stability of kinetic \(k\)-centers (Q2662690) (← links)
- EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS* (Q2755583) (← links)
- Rectilinear <i>m</i> -Center problem (Q3035110) (← links)
- The 1-Center and 1-Highway Problem (Q4899274) (← links)
- Continuous Center Problems (Q5506719) (← links)
- (Q5859884) (← links)
- Intersecting disks using two congruent disks (Q5918623) (← links)
- Covering a set of line segments with a few squares (Q5925557) (← links)
- Intersecting disks using two congruent disks (Q5925580) (← links)
- Covering a set of line segments with a few squares (Q5925680) (← links)
- Discrete and mixed two-center problems for line segments (Q6121433) (← links)
- The board packing problem (Q6167668) (← links)