The following pages link to Finding tailored partitions (Q3348447):
Displaying 31 items.
- Covering a set of points by two axis-parallel boxes (Q294806) (← links)
- A faster algorithm for the two-center decision problem (Q685492) (← links)
- Improved algorithms for the bichromatic two-center problem for pairs of points (Q824325) (← links)
- A fast algorithm for the alpha-connected two-center decision problem (Q1007526) (← links)
- Applications of a semi-dynamic convex hull algorithm (Q1196456) (← links)
- Minimizing the sum of diameters efficiently (Q1199831) (← links)
- On some geometric selection and optimization problems via sorted matrices (Q1265327) (← links)
- Continuous location of dimensional structures. (Q1410321) (← links)
- A randomized approximation scheme for metric MAX-CUT (Q1604207) (← links)
- The mixed center location problem (Q1631666) (← links)
- Geometric clustering in normed planes (Q1631777) (← links)
- Covering points with convex sets of minimum size (Q1705773) (← links)
- Some clustering algorithms in normed planes (Q1792096) (← links)
- \(\alpha\)-kernel problem with fuzzy visibility (Q1920271) (← links)
- The 2-center problem in three dimensions (Q1947989) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- The discrete and mixed minimax 2-center problems (Q2424880) (← links)
- Three-clustering of points in the plane. (Q2482902) (← links)
- EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS* (Q2755583) (← links)
- The Mixed Center Location Problem (Q2958327) (← links)
- ON RECTANGULAR COVERING PROBLEMS (Q3401889) (← links)
- The Discrete and Mixed Minimax 2-Center Problem (Q3467837) (← links)
- OPTIMAL LINE BIPARTITIONS OF POINT SETS (Q4513232) (← links)
- COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET (Q4513242) (← links)
- On some geometric selection and optimization problems via sorted matrices (Q5057419) (← links)
- Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining (Q5057431) (← links)
- Covering convex polygons by two congruent disks (Q5918557) (← links)
- Intersecting disks using two congruent disks (Q5918623) (← links)
- Intersecting disks using two congruent disks (Q5925580) (← links)
- Covering convex polygons by two congruent disks (Q5970791) (← links)
- Optimal line bipartitions of point sets (Q6487424) (← links)
