On the Tree Augmentation Problem

ESA, pp. 61:1-61:14, 2017.

Cited by: 11|Views6


In the Tree Augmentation problem we are given a tree $T=(V,F)$ and a set $E subseteq V times V$ of edges with positive integer costs ${c_e:e E}$. The goal is to augment $T$ by a minimum cost edge set $J subseteq E$ such that $T cup J$ is $2$-edge-connected. We obtain the following results. Recently, Adjiashvili [SODA 17] introduced a nov...More



Get fulltext within 24h
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.


Upload a single paper

for 5 coins

Wechat's Red Packet

Upload 50 articles

for 280 coins

Wechat's Red Packet

Upload 200 articles

for 1200 coins

Wechat's Red Packet

Upload 500 articles

for 3000 coins

Wechat's Red Packet

Upload 1000 articles

for 7000 coins

Wechat's Red Packet
Your rating :