Pages that link to "Item:Q1059958"
From MaRDI portal
The following pages link to Clustering to minimize the maximum intercluster distance (Q1059958):
Displayed 21 items.
- Approximation algorithms for Hamming clustering problems (Q876719) (← links)
- A linear-space algorithm for distance preserving graph embedding (Q1005326) (← links)
- Hexagonal unit network - a tool for proving the NP-completeness results of geometric problems (Q1071507) (← links)
- Approximation algorithms for geometric median problems (Q1209349) (← links)
- Generalized \(p\)-center problems: Complexity results and approximation algorithms (Q1278142) (← links)
- Compact location problems (Q1391322) (← links)
- Fault tolerant \(K\)-center problems (Q1575549) (← links)
- Performance guarantees for hierarchical clustering (Q1780451) (← links)
- Approximating uniform triangular meshes in polygons. (Q1853569) (← links)
- A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
- A multi-dimensional approach to force-directed layouts of large graphs (Q1883577) (← links)
- FCM-based model selection algorithms for determining the number of clusters (Q1887804) (← links)
- Deformable spanners and applications (Q2507157) (← links)
- Optimization on Lie manifolds and pattern recognition (Q2573125) (← links)
- A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM (Q3430335) (← links)
- An Optimal Incremental Algorithm for Minimizing Lateness with Rejection (Q3541120) (← links)
- (Q4520238) (← links)
- On Min-Max r-Gatherings (Q5443378) (← links)
- New Algorithms for k-Center and Extensions (Q5505644) (← links)
- JOINT SEPARATION OF GEOMETRIC CLUSTERS AND THE EXTREME IRREGULARITIES OF REGULAR POLYHEDRA (Q5709137) (← links)
- Approximation algorithms for hierarchical location problems (Q5920573) (← links)