Finding diameter-reducing shortcuts in trees

In the k-Diameter-Optimally Augmenting Tree Problem we are given a tree T of n vertices embedded in an unknown metric space. An oracle can report the cost of any edge in constant time, and we want to augment T with k shortcuts to minimize the resulting diameter. When k=1, O(nlog⁡n)-time algorithms e...

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 153; p. 103658
Main Authors:	Bilò, Davide, Gualà, Luciano, Leucci, Stefano, Pepè Sciarria, Luca
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.11.2025
Subjects:	Approximation algorithms Fast diameter computation Time-efficient algorithms Tree diameter augmentation Approximation algorithms Time-efficient algorithms Tree diameter augmentation Fast diameter computation
ISSN:	0022-0000
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!