Pages that link to "Item:Q2884573"
From MaRDI portal
The following pages link to On clustering to minimize the sum of radii (Q2884573):
Displaying 12 items.
- On minimum sum of radii and diameters clustering (Q494937) (← links)
- On metric clustering to minimize the sum of radii (Q970610) (← links)
- Clustering to minimize the maximum intercluster distance (Q1059958) (← links)
- Connecting a set of circles with minimum sum of radii (Q1699280) (← links)
- Clustering to minimize the sum of cluster diameters (Q1887718) (← links)
- Average case network lifetime on an interval with adjustable sensing ranges (Q2345943) (← links)
- A PTAS for the disk cover problem of geometric objects (Q2450711) (← links)
- Fault-tolerant covering problems in metric spaces (Q2659766) (← links)
- Faster algorithms for some optimization problems on collinear points (Q5132648) (← links)
- Maximizing the Sum of Radii of Disjoint Balls or Disks (Q5745395) (← links)
- Covering a set of points with a minimum number of equal disks via simulated annealing (Q6097195) (← links)
- Approximating fair \(k\)-min-sum-radii in Euclidean space (Q6574937) (← links)