On the connected minimum sum of radii problem
From MaRDI portal
Cites work
- A \((3 + \epsilon)\)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds
- A Best Possible Heuristic for the k-Center Problem
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A General Approximation Technique for Constrained Forest Problems
- Analyzing the optimal neighborhood: algorithms for budgeted and partial connected dominating set problems
- Approximating connected facility location with lower and upper bounds via LP rounding
- Approximation algorithms for connected dominating sets
- Cluster analysis and mathematical programming
- Clustering to minimize the sum of cluster diameters
- scientific article; zbMATH DE number 1617263 (Why is no real title available?)
- scientific article; zbMATH DE number 5764866 (Why is no real title available?)
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Improved polynomial-time approximations for clustering with minimum sum of radii or diameters
- On metric clustering to minimize the sum of radii
- Primal-dual algorithms for connected facility location problems
- Provisioning a virtual private network: a network design problem for multicommodity flow
- Reducibility among combinatorial problems
- Revisiting connected dominating sets: an almost optimal local information algorithm
- Simpler and better approximation algorithms for network design
- The complexity of theorem-proving procedures
This page was built for publication: On the connected minimum sum of radii problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7260612)
