Pages that link to "Item:Q4857543"
From MaRDI portal
The following pages link to Static and Dynamic Algorithms for k-Point Clustering Problems (Q4857543):
Displayed 13 items.
- On enclosing k points by a circle (Q674185) (← 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)
- A (slightly) faster algorithm for Klee's measure problem (Q1037647) (← links)
- Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation (Q1041762) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← 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)
- A combinatorial theorem on labeling squares with points and its application (Q2479570) (← links)
- EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING (Q4682165) (← links)
- LABELING POINTS WITH CIRCLES (Q4682174) (← links)
- Computing the Smallest T-Shaped Polygon Containing k Points (Q4780527) (← links)