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

DOI10.1007/11940128_58zbMath1135.68524OpenAlexW2145630038MaRDI QIDQ5459152

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) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80) Distance in graphs (05C12) Approximation algorithms (68W25)

Related Items (4)

Dynamic clustering to minimize the sum of radii ⋮ Locating Facilities on a Network to Minimize Their Average Service Radius ⋮ The 2-radius and 2-radiian problems on trees ⋮ Unnamed Item

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