On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems☆
References (5)
- et al.
A simple heuristic for the p-centre problem
Oper. Res. Lett.
(1985) - Fan R.K. Chung, “Diameter of graphs: old problems and new results”, Bell Communications Research Technical Memorandum...
There are more references available in the full text version of this article.
Cited by (68)
Augmenting graphs to minimize the radius
2023, Computational Geometry: Theory and ApplicationsA survey of parameterized algorithms and the complexity of edge modification
2023, Computer Science ReviewAlmost optimal algorithms for diameter-optimally augmenting trees
2022, Theoretical Computer ScienceCitation Excerpt :In the more general setting, the problem is NP-hard [7], not approximable within logarithmic factors unless P=NP [8], and some of its variants – parameterized w.r.t. the overall cost of added shortcuts and resulting diameter – are even W[2]-hard [9,10]. Therefore, several approximation algorithms have been developed for all these variations [8,11,12,9,13]. Finally, upper and lower bounds on the values of the diameters of the augmented graphs have also been investigated in [14–16].
Complexity and algorithms for constant diameter augmentation problems
2022, Theoretical Computer ScienceAlgorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
2021, Theoretical Computer ScienceA linear-time algorithm for radius-optimally augmenting paths in a metric space
2021, Computational Geometry: Theory and Applications
- ☆
Work supported in part by ONR contract N00014-90-J-1649, NSF contract DDM-8922712 and the Center for Telecommunications Research under NSF Grant CDR 84-21402.
Copyright © 1992 Published by Elsevier B.V.