Finding Almost Tight Witness Trees
Data Structures and Algorithms
2023-05-09 v3 Combinatorics
Abstract
This paper addresses a graph optimization problem, called the Witness Tree problem, which seeks a spanning tree of a graph minimizing a certain non-linear objective function. This problem is of interest because it plays a crucial role in the analysis of the best approximation algorithms for two fundamental network design problems: Steiner Tree and Node-Tree Augmentation. We will show how a wiser choice of witness trees leads to an improved approximation for Node-Tree Augmentation, and for Steiner Tree in special classes of graphs.
Cite
@article{arxiv.2211.12431,
title = {Finding Almost Tight Witness Trees},
author = {Dylan Hyatt-Denesik and Afrouz Jabal Ameli and Laura Sanità},
journal= {arXiv preprint arXiv:2211.12431},
year = {2023}
}
Comments
33 pages, 7 figures, submitted to IPCO 2023