Dynamic sum-radii clustering
From MaRDI portal
Publication:2980896
DOI10.1007/978-3-319-53925-6_3zbMATH Open1485.90061OpenAlexW2338439824MaRDI QIDQ2980896FDOQ2980896
Authors: Nicolas K. Blanchard, Nicolas Schabanel 
Publication date: 5 May 2017
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53925-6_3
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Discrete location and assignment (90B80)
Cites Work
- The Structure and Function of Complex Networks
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Greedy Strikes Back: Improved Facility Location Algorithms
- Approximation Algorithms for Metric Facility Location Problems
- Heuristics for the fixed cost median problem
- Analytical approach to parallel repetition
- Clustering to minimize the sum of cluster diameters
- On minimum sum of radii and diameters clustering
- Facility location in evolving metrics
- Online sum-radii clustering
- Dynamic facility location via exponential clocks
Cited In (11)
- Temporal clustering
- Reallocating multiple facilities on the line
- Multistage knapsack
- Dynamic clustering to minimize the sum of radii
- Approximation algorithms for clustering with dynamic points
- Approximation algorithms for clustering with dynamic points
- Online multistage subset maximization problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dynamic clustering to minimize the sum of radii
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)
