Pages that link to "Item:Q1059958"

The following pages link to Clustering to minimize the maximum intercluster distance (Q1059958):

Displaying 50 items.

• Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem (Q2217474) (← links)
• Complexity and inapproximability results for balanced connected subgraph problem (Q2232593) (← links)
• Initializing \(k\)-means clustering by bootstrap and data depth (Q2236768) (← links)
• Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
• Incremental space-filling design based on coverings and spacings: improving upon low discrepancy sequences (Q2241652) (← links)
• Adaptive consensus reaching process with hybrid strategies for large-scale group decision making (Q2286885) (← links)
• Maximum-likelihood approximate nearest neighbor method in real-time image recognition (Q2289612) (← links)
• Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186) (← links)
• An adaptive probabilistic algorithm for online \(k\)-center clustering (Q2313750) (← links)
• On interval and circular-arc covering problems (Q2327673) (← links)
• Graph induced complex on point data (Q2354923) (← links)
• A mixed breadth-depth first strategy for the branch and bound tree of Euclidean \(k\)-center problems (Q2377164) (← links)
• Improved analysis of complete-linkage clustering (Q2408165) (← links)
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
• A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control (Q2448429) (← links)
• Balanced compact clustering for efficient range queries in metric spaces (Q2449057) (← links)
• Communication-aware processor allocation for supercomputers: Finding point sets of small average distance (Q2480901) (← links)
• Deformable spanners and applications (Q2507157) (← links)
• Finding a cluster of points and the grey pattern quadratic assignment problem (Q2507561) (← links)
• Optimization on Lie manifolds and pattern recognition (Q2573125) (← links)
• The Euclidean \(k\)-supplier problem in \(I R^2\) (Q2661589) (← links)
• On some variants of Euclidean \(k\)-supplier (Q2670484) (← links)
• On clustering with discounts (Q2671820) (← links)
• The \(p\)-center problem under locational uncertainty of demand points (Q2688470) (← links)
• On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← links)
• Allocating indivisible items with minimum dissatisfaction on preference graphs (Q2695444) (← links)
• Hedonic diversity games revisited (Q2695455) (← links)
• Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier (Q2699973) (← links)
• A faster implementation of the Goemans-Williamson clustering algorithm (Q2768267) (← links)
• COMPUTING <i>k</i> CENTERS OVER STREAMING DATA FOR SMALL <i>k</i> (Q2939917) (← links)
• Privacy in Elections: k-Anonymizing Preference Orders (Q2947888) (← links)
• Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls (Q2948466) (← links)
• Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q2948479) (← links)
• Approximability results for the converse connected<i>p</i>-centre problem^† (Q2958261) (← links)
• The Mixed Center Location Problem (Q2958327) (← links)
• (Q3005537) (← links)
• APPROXIMATELY ISOMETRIC SHAPE CORRESPONDENCE BY MATCHING POINTWISE SPECTRAL FEATURES AND GLOBAL GEODESIC STRUCTURES (Q3101554) (← links)
• Algorithms and complexity of range clustering (Q3120783) (← links)
• A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM (Q3430335) (← links)
• (Q3498171) (← links)
• An Optimal Incremental Algorithm for Minimizing Lateness with Rejection (Q3541120) (← links)
• Minimum-diameter covering problems (Q4520238) (← links)
• Non-rigid Shape Correspondence Using Surface Descriptors and Metric Structures in the Spectral Domain (Q4603065) (← links)
• (Q4709207) (← links)
• ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS (Q4931731) (← links)
• Data Exploration by Representative Region Selection: Axioms and Convergence (Q4958552) (← links)
• Clustering in Hilbert’s Projective Geometry: The Case Studies of the Probability Simplex and the Elliptope of Correlation Matrices (Q4967762) (← links)
• (Q4969053) (← links)
• Sparse Approximation via Generating Point Sets (Q4972677) (← links)
• Generalized Center Problems with Outliers (Q4972687) (← links)