Pages that link to "Item:Q3680584"

The following pages link to A Best Possible Heuristic for the <i>k</i>-Center Problem (Q3680584):

Displaying 50 items.

• A genetic algorithm for the maximum 2-packing set problem (Q2019714) (← links)
• Partition of unity methods for signal processing on graphs (Q2048685) (← 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)
• The weighted \(k\)-center problem in trees for fixed \(k\) (Q2077394) (← links)
• A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
• Fair colorful \(k\)-center clustering (Q2118132) (← links)
• Preclustering algorithms for imprecise points (Q2144264) (← links)
• The polygon burning problem (Q2154090) (← links)
• Hierarchy cost of hierarchical clusterings (Q2168755) (← links)
• Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
• The distance-constrained matroid median problem (Q2182102) (← links)
• Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs (Q2185812) (← links)
• Ordinal approximation for social choice, matching, and facility location problems given candidate positions (Q2190377) (← links)
• A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem (Q2201993) (← links)
• Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters (Q2206419) (← links)
• Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem (Q2217474) (← links)
• Iterative partial rounding for vertex cover with hard capacities (Q2223692) (← links)
• Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186) (← links)
• Reverse greedy is bad for \(k\)-center (Q2308462) (← links)
• An adaptive probabilistic algorithm for online \(k\)-center clustering (Q2313750) (← links)
• The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
• The probabilistic approach to limited packings in graphs (Q2341760) (← links)
• A mixed breadth-depth first strategy for the branch and bound tree of Euclidean \(k\)-center problems (Q2377164) (← links)
• Asymmetric \(k\)-center with minimum coverage (Q2380063) (← links)
• Burning a graph is hard (Q2410223) (← links)
• On ill-conceived initialization in archetypal analysis (Q2418343) (← links)
• On the complexity of some problems of searching for a family of disjoint clusters (Q2424385) (← links)
• Client assignment problems for latency minimization (Q2424655) (← links)
• Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs (Q2441507) (← links)
• Operations research and data mining (Q2467295) (← links)
• Asymmetry in \(k\)-center variants (Q2503348) (← links)
• One-way and round-trip center location problems (Q2568335) (← links)
• A new internal index based on density core for clustering validation (Q2656786) (← 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)
• New algorithms for a simple measure of network partitioning (Q2700788) (← links)
• Manifold Intrinsic Similarity (Q2789838) (← links)
• The Mixed Center Location Problem (Q2958327) (← links)
• APPROXIMATELY ISOMETRIC SHAPE CORRESPONDENCE BY MATCHING POINTWISE SPECTRAL FEATURES AND GLOBAL GEODESIC STRUCTURES (Q3101554) (← links)
• A Family of Unsupervised Sampling Algorithms (Q3297372) (← links)
• Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
• FICW: Frequent itemset based text clustering with window constraint (Q3446037) (← links)
• On Metric Clustering to Minimize the Sum of Radii (Q3512466) (← links)
• VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION (Q3526982) (← links)
• (Q3783313) (← links)
• (Q3800086) (← links)
• Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search (Q4422624) (← links)
• Non-rigid Shape Correspondence Using Surface Descriptors and Metric Structures in the Spectral Domain (Q4603065) (← links)