Pages that link to "Item:Q4723543"

The following pages link to On the rectangularp-center problem (Q4723543):

Displaying 46 items.

• Efficiently approximating color-spanning balls (Q284593) (← links)
• A geometric characterisation of the quadratic min-power centre (Q297177) (← links)
• Locating an axis-parallel rectangle on a Manhattan plane (Q458948) (← 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 note on the m-center problem with rectilinear distances (Q913636) (← links)
• A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane (Q1007585) (← links)
• Polynomial algorithms for restricted Euclidean p-centre problems (Q1116694) (← 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)
• The mixed center location problem (Q1631666) (← links)
• Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← links)
• Dominant, an algorithm for the \(p\)-center problem. (Q1811146) (← 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)
• On the planar piecewise quadratic 1-center problem (Q2379920) (← 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)
• (Q2708487) (← links)
• EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS* (Q2755583) (← links)
• Rectilinear <i>m</i> -Center problem (Q3035110) (← links)
• (Q3358522) (← links)
• A vertex-closing approach to the p-center problem (Q3474476) (← links)
• An Algorithm for the <i>p</i>-Center Problem in the Plane (Q3748028) (← links)
• Note on a Rectilinear Distance Round-Trip Location Problem (Q3755209) (← links)
• Conditional <i>p</i>-Center Problems (Q3830783) (← links)
• The p-center problem in \(R^ n\) with weighted Tchebycheff norms (Q3989472) (← links)
• The p-center location problem in an area (Q4228753) (← 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)