Pages that link to "Item:Q1059958"
From MaRDI portal
The following pages link to Clustering to minimize the maximum intercluster distance (Q1059958):
Displaying 50 items.
- Approximation algorithms for min-sum \(p\)-clustering (Q1281390) (← links)
- Compact location problems (Q1391322) (← links)
- Fault tolerant \(K\)-center problems (Q1575549) (← links)
- The mixed center location problem (Q1631666) (← links)
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
- Only distances are required to reconstruct submanifolds (Q1693317) (← links)
- A connection between sports and matroids: how many teams can we beat? (Q1702129) (← links)
- The connected disk covering problem (Q1702836) (← links)
- Distance-based index structures for fast similarity search (Q1709472) (← links)
- On the complexity of bribery with distance restrictions (Q1713407) (← links)
- Adaptive initialization method based on spatial local information for \(k\)-means algorithm (Q1719093) (← links)
- Network community detection on metric space (Q1736703) (← links)
- Improved approximation algorithms for capacitated fault-tolerant \(k\)-center (Q1742378) (← links)
- Performance guarantees for hierarchical clustering (Q1780451) (← links)
- Approximating uniform triangular meshes in polygons. (Q1853569) (← links)
- Minimization subproblems and heuristics for an applied clustering problem (Q1869508) (← links)
- Fast approximations for sums of distances, clustering and the Fermat-Weber problem (Q1869747) (← 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)
- Clustering to minimize the sum of cluster diameters (Q1887718) (← links)
- FCM-based model selection algorithms for determining the number of clusters (Q1887804) (← links)
- A distributed approximation algorithm for the bottleneck connected dominating set problem (Q1926605) (← links)
- Quantum speed-up for unsupervised learning (Q1945031) (← links)
- The 2-center problem in three dimensions (Q1947989) (← links)
- Complexity of the multi-service center problem (Q2006773) (← links)
- Faster balanced clusterings in high dimension (Q2006774) (← links)
- Large group decision-making incorporating decision risk and risk attitude: a statistical approach (Q2023179) (← links)
- Local fairness in hedonic games via individual threshold coalitions (Q2034790) (← links)
- Algorithmic aspects of 2-secure domination in graphs (Q2045038) (← links)
- Partition of unity methods for signal processing on graphs (Q2048685) (← links)
- Near-optimal clustering in the \(k\)-machine model (Q2062125) (← links)
- An empirical comparison between stochastic and deterministic centroid initialisation for K-means variations (Q2071340) (← links)
- Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints (Q2072077) (← links)
- On perturbation resilience of non-uniform \(k\)-center (Q2072096) (← links)
- On Pareto optimality in social distance games (Q2093365) (← links)
- Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
- Complexity and approximability of minimum path-collection exact covers (Q2110360) (← links)
- A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
- Fair colorful \(k\)-center clustering (Q2118132) (← links)
- Simplified group activity selection with group size constraints (Q2121462) (← links)
- Online unit clustering and unit covering in higher dimensions (Q2134741) (← links)
- The polygon burning problem (Q2154090) (← links)
- A new initialization and performance measure for the rough \(k\)-means clustering (Q2156472) (← links)
- Hierarchy cost of hierarchical clusterings (Q2168755) (← links)
- Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
- On packing time-respecting arborescences (Q2172082) (← links)
- The distance-constrained matroid median problem (Q2182102) (← links)
- Complexity of control in judgment aggregation for uniform premise-based quota rules (Q2186810) (← links)
- New families of stable simplicial filtration functors (Q2187161) (← links)
- Near-optimal coresets of kernel density estimates (Q2189735) (← links)
