License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2018.40
URN: urn:nbn:de:0030-drops-99888
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9988/
Go to the corresponding LIPIcs Volume Portal

Bilò, Davide

Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees

pdf-format:
LIPIcs-ISAAC-2018-40.pdf (0.5 MB)

Abstract

We consider the problem of augmenting an n-vertex tree with one shortcut in order to minimize the diameter of the resulting graph. The tree is embedded in an unknown space and we have access to an oracle that, when queried on a pair of vertices u and v, reports the weight of the shortcut (u,v) in constant time. Previously, the problem was solved in O(n^2 log^3 n) time for general weights [Oh and Ahn, ISAAC 2016], in O(n^2 log n) time for trees embedded in a metric space [Große et al., https://arxiv.org/abs/1607.05547], and in O(n log n) time for paths embedded in a metric space [Wang, WADS 2017]. Furthermore, a (1+epsilon)-approximation algorithm running in O(n+1/epsilon^3) has been designed for paths embedded in R^d, for constant values of d [Große et al., ICALP 2015].
The contribution of this paper is twofold: we address the problem for trees (not only paths) and we also improve upon all known results. More precisely, we design a time-optimal O(n^2) time algorithm for general weights. Moreover, for trees embedded in a metric space, we design (i) an exact O(n log n) time algorithm and (ii) a (1+epsilon)-approximation algorithm that runs in O(n+ epsilon^{-1}log epsilon^{-1}) time.

BibTeX - Entry

@InProceedings{bil:LIPIcs:2018:9988,
  author =	{Davide Bil{\`o}},
  title =	{{Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees}},
  booktitle =	{29th International Symposium on Algorithms and Computation  (ISAAC 2018)},
  pages =	{40:1--40:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-094-1},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{123},
  editor =	{Wen-Lian Hsu and Der-Tsai Lee and Chung-Shou Liao},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9988},
  URN =		{urn:nbn:de:0030-drops-99888},
  doi =		{10.4230/LIPIcs.ISAAC.2018.40},
  annote =	{Keywords: Graph diameter, augmentation problem, trees, time-efficient algorithms}
}

Keywords: Graph diameter, augmentation problem, trees, time-efficient algorithms
Collection: 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Issue Date: 2018
Date of publication: 06.12.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI