Finding Almost Tight Witness Trees

Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità

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…