##
###
Fast Distributed Approximation for TAP and 2-Edge-Connectivity
[article]

Keren Censor-Hillel, Michal Dory

2019
*
arXiv
*
pre-print

*approximation* algorithms, and an O(h_MST+√(n)^*n)-*round* 3-*approximation* algorithm for the weighted case, where h_MST is the height of the MST of the graph. ...
In this paper, we provide the first fast distributed *approximations* for TAP. We present a distributed 2-*approximation* for weighted TAP which completes in O(h) *rounds*, where h is the height of T. ...
Note that *using* the labels of an edge e, a *vertex* v knows if this edge *covers* {v, p(v)} *using* LCA computations. ...

arXiv:1711.03359v2
fatcat:xfainfkm6vcr5mkojqcklolxce