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.
- (Q4989372) (← links)
- Bayesian Decision Making in Groups is Hard (Q4994179) (← links)
- Generalized center problems with outliers (Q5002700) (← links)
- (Q5002778) (← links)
- (Q5009501) (← links)
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (Q5009565) (← links)
- Gaussian Process Landmarking on Manifolds (Q5025781) (← links)
- Gaussian Process Landmarking for Three-Dimensional Geometric Morphometrics (Q5025782) (← links)
- Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results (Q5026258) (← links)
- A Technique for Obtaining True Approximations for k-Center with Covering Constraints (Q5041734) (← links)
- Fair Colorful k-Center Clustering (Q5041747) (← links)
- Altruistic Hedonic Games (Q5043571) (← links)
- Facility location with dynamic distance functions (Q5054838) (← links)
- (Q5075746) (← links)
- Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction (Q5075781) (← links)
- (Q5091167) (← links)
- Stateless Information Dissemination Algorithms (Q5100958) (← links)
- The Euclidean <i>k</i>-Supplier Problem (Q5108254) (← links)
- Approximate Range Queries for Clustering (Q5116522) (← links)
- (Q5120561) (← links)
- Complexity of the multi-service center problem (Q5136268) (← links)
- (Q5149034) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- Group-Valued Regularization for Motion Segmentation of Articulated Shapes (Q5258554) (← links)
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality (Q5283364) (← links)
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q5361233) (← links)
- An Initialization Method Based on Hybrid Distance for <i>k</i>-Means Algorithm (Q5380869) (← 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)
- Constrained k-Center Problem on a Convex Polygon (Q5859739) (← links)
- (Q5874507) (← links)
- (Q5874534) (← links)
- On the cost of essentially fair clusterings (Q5875470) (← links)
- Small Space Stream Summary for Matroid Center (Q5875472) (← links)
- Parameterized approximation algorithms for some location problems in graphs (Q5915898) (← links)
- Robustness among multiwinner voting rules (Q5918366) (← links)
- Robust \(k\)-center with two types of radii (Q5918429) (← links)
- Covering convex polygons by two congruent disks (Q5918557) (← links)
- Dichotomy result on 3-regular bipartite non-negative functions (Q5918629) (← links)
- Mixed fault tolerance in server assignment: combining reinforcement and backup (Q5918902) (← links)
- Online unit covering in Euclidean space (Q5919348) (← links)
- The clever shopper problem (Q5919456) (← links)
- Approximation algorithms for hierarchical location problems (Q5920573) (← links)
- Dichotomy result on 3-regular bipartite non-negative functions (Q5925621) (← links)
- Robust \(k\)-center with two types of radii (Q5925649) (← links)
- Covering convex polygons by two congruent disks (Q5970791) (← links)
- Approximability results for the $p$-centdian and the converse centdian problems (Q6045453) (← links)
- Min-Max-Min Optimization with Smooth and Strongly Convex Objectives (Q6053591) (← links)
- (Q6062155) (← links)
