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.

• New approximation results for resource replication problems (Q270001) (← links)
• A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773) (← links)
• The \(p\)-neighbor \(k\)-center problem (Q293209) (← links)
• Matroid and knapsack center problems (Q300451) (← links)
• An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
• Full and partial symmetries of non-rigid shapes (Q408805) (← links)
• Nonlinear dimensionality reduction by topologically constrained isometric embedding (Q408807) (← links)
• A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching (Q408814) (← links)
• On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689) (← links)
• A self-stabilizing algorithm to maximal 2-packing with improved complexity (Q436592) (← links)
• Pivot selection: dimension reduction for distance-based indexing (Q450522) (← links)
• Volume in general metric spaces (Q464741) (← links)
• The fault-tolerant capacitated \(K\)-center problem (Q484314) (← links)
• On minimum sum of radii and diameters clustering (Q494937) (← links)
• Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
• The minimum weight \(t\)-composition of an integer (Q690540) (← links)
• An approximation algorithm for the edge-dilation \(k\)-center problem. (Q703267) (← links)
• More on limited packings in graphs (Q782753) (← links)
• Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
• On hierarchical diameter-clustering and the supplier problem (Q839643) (← links)
• Topology-invariant similarity of nonrigid shapes (Q847482) (← links)
• Approximation algorithms for Hamming clustering problems (Q876719) (← links)
• Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
• On metric clustering to minimize the sum of radii (Q970610) (← links)
• Approximation algorithm for the kinetic robust \(k\)-center problem (Q982946) (← links)
• Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem (Q1079133) (← links)
• A heuristic for the p-center problem in graphs (Q1098862) (← links)
• K-center and K-median problems in graded distances (Q1274996) (← links)
• A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem (Q1291662) (← links)
• A recurrence template for several parameters in series-parallel graphs (Q1336624) (← links)
• Lexicographic local search and the \(p\)-center problem. (Q1410610) (← links)
• Progressive scattered data filtering. (Q1410867) (← links)
• Fault tolerant \(K\)-center problems (Q1575549) (← links)
• The mixed center location problem (Q1631666) (← links)
• Clustering sparse binary data with hierarchical Bayesian Bernoulli mixture model (Q1662817) (← links)
• One-class classification with extreme learning machine (Q1665625) (← links)
• The connected disk covering problem (Q1702836) (← links)
• A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
• Improved approximation algorithms for capacitated fault-tolerant \(k\)-center (Q1742378) (← links)
• Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
• Cluster ensembles: a survey of approaches with recent extensions and applications (Q1750312) (← links)
• \(k\)-center problems with minimum coverage (Q1770377) (← links)
• Performance guarantees for hierarchical clustering (Q1780451) (← links)
• Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs (Q1799228) (← links)
• A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
• Clustering to minimize the sum of cluster diameters (Q1887718) (← links)
• Designing and reporting on computational experiments with heuristic methods (Q1922625) (← links)
• Some variations on constrained minimum enclosing circle problem (Q1944391) (← links)
• Complexity of the multi-service center problem (Q2006773) (← links)
• Faster balanced clusterings in high dimension (Q2006774) (← links)