Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees-Reference-Cited by-同舟云学术

Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees

Published:2019-02 Issue:02 Volume:30 Page:293-313
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

Große Ulrike¹,Knauer Christian¹,Stehn Fabian¹,Gudmundsson Joachim²,Smid Michiel³

Affiliation:

1. Institut für Angewandte Informatik, Universität Bayreuth, Universitätsstrasse 30, 95447 Bayreuth, Germany

2. School of Information Technologies, J12, The University of Sydney, NSW 2006, Sydney, Australia

3. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Canada K1S 5B6, Canada

Abstract

We consider the problem of augmenting an [Formula: see text]-vertex graph embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the resulting graph. We present exact algorithms for the cases when (i) the input graph is a path, running in [Formula: see text] time, and (ii) the input graph is a tree, running in [Formula: see text] time. We also present an algorithm for paths that computes a [Formula: see text]-approximation in [Formula: see text] time.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054119500060

Reference23 articles.

1. Decreasing the diameter of bounded degree graphs

2. Computational Geometry

3. Improved approximability and non-approximability results for graph diameter decreasing problems

4. Augmenting Trees to Meet Biconnectivity and Diameter Constraints

5. Diameter bounds for altered graphs

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Finding Diameter-Reducing Shortcuts in Trees;Lecture Notes in Computer Science;2023

2. Almost optimal algorithms for diameter-optimally augmenting trees;Theoretical Computer Science;2022-09