Improved Approximation Algorithms for Minimum Cost Node-Connectivity Augmentation Problems

Theory Comput. Syst., Volume 62, Issue 3, 2018, Pages 510-532.

Cited by: 3|Views2
EI

Abstract:

Let (, ) denote the maximum number of pairwise internally disjoint -paths in a graph = (, ). For a set of terminals, is --connected if (, ) ≥ for all , ∈ ; if = then is -connected. Given a root node , is - (, )-connected if (, ) ≥ for all ∈ . We consider the corresponding min-cost connectivity augmentation problems, where we...More

Code:

Data:

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 :
0

 

Tags
Comments