Dynamic sum-radii clustering

DOI10.1007/978-3-319-53925-6_3MaRDI QIDQ2980896zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

clusteringapproximation algorithmsfacility locationdynamic graphs

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Discrete location and assignment (90B80)

Recommendations

• Dynamic clustering to minimize the sum of radii
• Dynamic clustering to minimize the sum of radii
• Facility location in evolving metrics
• Clustering to minimize the sum of cluster diameters
• Online sum-radii clustering

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)

• 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
• scientific article; zbMATH DE number 7525448 (Why is no real title available?)
• scientific article; zbMATH DE number 7561666 (Why is no real title available?)
• scientific article; zbMATH DE number 7238962 (Why is no real title available?)
• 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)