Pages that link to "Item:Q1601015"

The following pages link to Exact and approximation algorithms for clustering (Q1601015):

Displaying 50 items.

• Exact algorithms for size constrained 2-clustering in the plane (Q288798) (← links)
• Graph clustering (Q458448) (← links)
• The computational complexity and approximability of a series of geometric covering problems (Q483201) (← links)
• Unit disk cover problem in 2D (Q491638) (← links)
• The within-strip discrete unit disk cover problem (Q528480) (← links)
• Theory and application of width bounded geometric separators (Q632801) (← links)
• Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
• An improved approximation algorithm for the most points covering problem (Q692901) (← links)
• Efficient approximation algorithms for clustering point-sets (Q733558) (← links)
• Covering many or few points with unit disks (Q839638) (← links)
• An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes (Q844164) (← links)
• Aggregation error for location models: Survey and analysis (Q1026594) (← links)
• Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
• Heuristic methods for large centroid clustering problems (Q1402504) (← links)
• Faster algorithms for the constrained \(k\)-means problem (Q1702850) (← links)
• Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
• Approximation algorithms for the metric maximum clustering problem with given cluster sizes. (Q1811624) (← links)
• Clustering motion (Q1889914) (← links)
• The 2-center problem in three dimensions (Q1947989) (← links)
• Linear-size universal discretization of geometric center-based problems in fixed dimensions (Q2125228) (← links)
• Preclustering algorithms for imprecise points (Q2144264) (← links)
• An efficient algorithm for the proximity connected two center problem (Q2169955) (← links)
• The parameterized hardness of the \(k\)-center problem in transportation networks (Q2182096) (← links)
• Bichromatic 2-center of pairs of points (Q2261579) (← links)
• On interval and circular-arc covering problems (Q2327673) (← links)
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
• A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
• A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
• The Euclidean \(k\)-supplier problem in \(I R^2\) (Q2661589) (← links)
• Polynomial time approximation schemes for all 1-center problems on metric rational set similarities (Q2663710) (← links)
• An algorithmic framework for solving geometric covering problems -- with applications (Q2929639) (← links)
• COMPUTING <i>k</i> CENTERS OVER STREAMING DATA FOR SMALL <i>k</i> (Q2939917) (← links)
• THE ALIGNED K-CENTER PROBLEM (Q2999091) (← links)
• On the Discrete Unit Disk Cover Problem (Q3078392) (← links)
• (Q3115213) (← links)
• (Q3191565) (← links)
• Clustering via the modified Petford-Welsh algorithm (Q3298117) (← links)
• Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620) (← links)
• Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (Q3449507) (← links)
• Linear-time approximation schemes for clustering problems in any dimensions (Q3578186) (← links)
• (Q4250235) (← links)
• A New Composite Algorithm for Clustering Problems (Q4344451) (← links)
• (Q4576266) (← links)
• Range-clustering queries (Q4580076) (← links)
• Approximation algorithms for projective clustering (Q4808316) (← links)
• Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions (Q4965103) (← links)
• Approximate Clustering with Same-Cluster Queries (Q4993306) (← links)
• The Parameterized Hardness of the k-Center Problem in Transportation Networks (Q5116483) (← links)
• Approximate Range Queries for Clustering (Q5116522) (← links)
• The Complete Gradient Clustering Algorithm: properties in practical applications (Q5127032) (← links)