Pages that link to "Item:Q1601015"
From MaRDI portal
The following pages link to Exact and approximation algorithms for clustering (Q1601015):
Displaying 40 items.
- 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)
- Covering many or few points with unit disks (Q839638) (← links)
- Aggregation error for location models: Survey and analysis (Q1026594) (← links)
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← 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)
- 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)
- Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (Q3449507) (← links)
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions (Q4965103) (← links)
- The Parameterized Hardness of the k-Center Problem in Transportation Networks (Q5116483) (← links)
- Approximate Range Queries for Clustering (Q5116522) (← links)
- (Q5136270) (← links)
- On capacitated covering with unit balls (Q5266149) (← links)
- ON THE DISCRETE UNIT DISK COVER PROBLEM (Q5300002) (← links)
- FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE (Q5694056) (← links)
- Constrained k-Center Problem on a Convex Polygon (Q5859739) (← links)
- Covering convex polygons by two congruent disks (Q5918557) (← links)
- Covering a set of line segments with a few squares (Q5925557) (← links)
- Covering a set of line segments with a few squares (Q5925680) (← links)
- Covering convex polygons by two congruent disks (Q5970791) (← links)
- Clustering with faulty centers (Q6092308) (← links)
