Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii

DOI10.1007/11940128_58MaRDI QIDQ5459152zbMATH OpenOpenAlexFDO

Authors Guido Proietti, Peter Widmayer

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11940128_58

zbMATH Keywords

NP-hardnessGraph partitionFacility location problemsGraph radiusClustering problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80)

Recommendations

• Locating Facilities on a Network to Minimize Their Average Service Radius
• The 2-radius and 2-radiian problems on trees
• scientific article; zbMATH DE number 867650
• Approximation algorithms for clustering to minimize the sum of diameters
• Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria

Cited in

(6)

• Locating Facilities on a Network to Minimize Their Average Service Radius
• Approximating fair \(k\)-min-sum-radii in Euclidean space
• scientific article; zbMATH DE number 867650 (Why is no real title available?)
• Dynamic clustering to minimize the sum of radii
• The 2-radius and 2-radiian problems on trees
• Dynamic clustering to minimize the sum of radii

This page was built for publication: Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459152)