Pages that link to "Item:Q1327455"
From MaRDI portal
The following pages link to Iterated nearest neighbors and finding minimal polytopes (Q1327455):
Displaying 42 items.
- Enclosing \(k\) points in the smallest axis parallel rectangle (Q293194) (← links)
- The approximation algorithms for a class of multiple-choice problem (Q344788) (← links)
- Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center (Q378186) (← links)
- Cause I'm a genial imprecise point: outlier detection for uncertain data (Q831712) (← links)
- A new approximation algorithm for labeling points with circle pairs (Q845698) (← links)
- Region-restricted clustering for geographic data mining (Q1000925) (← links)
- A simple factor-3 approximation for labeling points with circles (Q1014403) (← links)
- Algorithms for optimal outlier removal (Q1026234) (← links)
- A note on maximum independent sets in rectangle intersection graphs (Q1029038) (← links)
- A (slightly) faster algorithm for Klee's measure problem (Q1037647) (← links)
- Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation (Q1041762) (← links)
- Optimal placement of convex polygons to maximize point containment (Q1265324) (← links)
- Offset-polygon annulus placement problems (Q1276941) (← links)
- Geometric applications of posets (Q1276942) (← links)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
- On nearest-neighbor graphs (Q1355198) (← links)
- Faster geometric \(k\)-point MST approximation (Q1370933) (← links)
- Compact location problems (Q1391322) (← links)
- Extending range queries and nearest neighbors (Q1841241) (← links)
- Algorithms for proximity problems in higher dimensions (Q1917037) (← links)
- Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
- Linear-size universal discretization of geometric center-based problems in fixed dimensions (Q2125228) (← links)
- On the \(k\)-colored rainbow sets in fixed dimensions (Q2150582) (← links)
- Complexity and approximation of the smallest \(k\)-enclosing ball problem (Q2346580) (← links)
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions (Q2380046) (← links)
- On finding a large number of 3D points with a small diameter (Q2457016) (← links)
- Covering points with a polygon (Q2477192) (← links)
- Translating a convex polygon to contain a maximum number of points. (Q2482905) (← links)
- Bottleneck convex subsets: finding \(k\) large convex sets in a point set (Q2695286) (← links)
- QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS (Q2708040) (← links)
- Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points (Q2792797) (← links)
- An Approximation Algorithm for the Smallest Color-Spanning Circle Problem (Q3196382) (← links)
- GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON (Q4650081) (← links)
- EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING (Q4682165) (← links)
- Computing the Smallest T-Shaped Polygon Containing k Points (Q4780527) (← links)
- POINT SET LABELING WITH SPECIFIED POSITIONS (Q4818545) (← links)
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions (Q4965103) (← links)
- Smallest k-enclosing rectangle revisited (Q5088950) (← links)
- Offset-polygon annulus placement problems (Q5096954) (← links)
- Geometric Applications of Posets (Q5096956) (← links)
- (Q5111741) (← links)
- Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set (Q6173215) (← links)
