Approximating Minimum-Cost Connectivity Problems via Uncrossable Bifamilies (vol 14, 37, 2018)

ACM TRANSACTIONS ON ALGORITHMS, 2018.

Cited by: 0|Views0

Abstract:

There are two errors in our article "Approximating Minimum-Cost Connectivity Problems via Uncrossable Bifamilies" (ACM Transactions on Algorithms (TALG), 9(1), Article No. 1, 2012). In that article, we consider the (undirected) Survivable Network problem. The input consists of a graph G = (V, E) with edge-costs, a set T. V of terminals, a...More

Code:

Data:

Get fulltext within 24h
Bibtex
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