Fast distributed approximation for TAP and 2-edge-connectivity

The tree augmentation problem (TAP) is a fundamental network design problem, in which the input is a graph G and a spanning tree T for it, and the goal is to augment T with a minimum set of edges Aug from G , such that T ∪ A u g is 2-edge-connected. TAP has been widely studied in the sequential sett...

Full description

Saved in:

Bibliographic Details
Published in:	Distributed computing Vol. 33; no. 2; pp. 145 - 168
Main Authors:	Censor-Hillel, Keren, Dory, Michal
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2020 Springer Nature B.V
Subjects:	Algorithms Apexes Approximation Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Connectivity Decision trees Graph theory Graphs Lower bounds Mathematical analysis Software Engineering/Programming and Operating Systems Theory of Computation Distributed graph algorithms Approximation algorithms Distributed network design Connectivity augmentation
ISSN:	0178-2770, 1432-0452
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!