Pages that link to "Item:Q2708233"
From MaRDI portal
The following pages link to Approximation algorithms for clustering to minimize the sum of diameters (Q2708233):
Displaying 22 items.
- An approximation algorithm for clustering graphs with dominating diametral path (Q290198) (← links)
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions (Q494805) (← links)
- On minimum sum of radii and diameters clustering (Q494937) (← links)
- Minimum sum of diameters clustering (Q581969) (← links)
- An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes (Q844164) (← links)
- On metric clustering to minimize the sum of radii (Q970610) (← links)
- Min sum clustering with penalties (Q976485) (← links)
- Approximation algorithms for min-sum \(p\)-clustering (Q1281390) (← links)
- Splitting an ordering into a partition to minimize diameter (Q1367012) (← links)
- Connecting a set of circles with minimum sum of radii (Q1699280) (← links)
- Approximation algorithms for the metric maximum clustering problem with given cluster sizes. (Q1811624) (← links)
- Clustering to minimize the sum of cluster diameters (Q1887718) (← links)
- Online clustering with variable sized clusters (Q1939661) (← links)
- Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints (Q2072077) (← links)
- Dynamic clustering to minimize the sum of radii (Q2205631) (← links)
- Online sum-radii clustering (Q2453160) (← links)
- Multi Cover of a Polygon Minimizing the Sum of Areas (Q3078391) (← links)
- On Metric Clustering to Minimize the Sum of Radii (Q3512466) (← links)
- Dynamic Digraph Connectivity Hastens Minimum Sum-of-Diameters Clustering (Q4652636) (← links)
- (Q5111737) (← links)
- (Q5160423) (← links)
- Approximating min-sum <i>k</i> -clustering in metric spaces (Q5175948) (← links)
