Dynamic Sum-Radii Clustering

DOI10.1007/978-3-319-53925-6_3zbMath1485.90061OpenAlexW2338439824MaRDI QIDQ2980896

Nicolas Schabanel, Nicolas K. Blanchard

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

clusteringfacility locationapproximation algorithmsdynamic graphs

Mathematics Subject Classification ID

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

Related Items (6)

Multistage knapsack ⋮ Reallocating multiple facilities on the line ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Online multistage subset maximization problems ⋮ Unnamed Item

Cites Work

• On minimum sum of radii and diameters clustering
• Clustering to minimize the sum of cluster diameters
• A 1.488 approximation algorithm for the uncapacitated facility location problem
• Online Sum-Radii Clustering
• Approximation Algorithms for Metric Facility Location Problems
• Heuristics for the fixed cost median problem
• Greedy Strikes Back: Improved Facility Location Algorithms
• The Structure and Function of Complex Networks
• Facility Location in Evolving Metrics
• Analytical approach to parallel repetition
• Dynamic Facility Location via Exponential Clocks

This page was built for publication: Dynamic Sum-Radii Clustering