Dynamic sum-radii clustering
From MaRDI portal
Recommendations
Cites work
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Analytical approach to parallel repetition
- Approximation Algorithms for Metric Facility Location Problems
- Clustering to minimize the sum of cluster diameters
- Dynamic facility location via exponential clocks
- Facility location in evolving metrics
- Greedy Strikes Back: Improved Facility Location Algorithms
- Heuristics for the fixed cost median problem
- On minimum sum of radii and diameters clustering
- Online sum-radii clustering
- The Structure and Function of Complex Networks
Cited in
(11)- Online multistage subset maximization problems
- Multistage knapsack
- Approximation algorithms for clustering with dynamic points
- Dynamic clustering to minimize the sum of radii
- Reallocating multiple facilities on the line
- scientific article; zbMATH DE number 7525448 (Why is no real title available?)
- Multistage knapsack
- Temporal clustering
- Dynamic clustering to minimize the sum of radii
- scientific article; zbMATH DE number 7238962 (Why is no real title available?)
- Approximation algorithms for clustering with dynamic points
This page was built for publication: Dynamic sum-radii clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980896)