On Fixed Cost -Flow Problems

Theory of Computing Systems, Volume 58, Issue 1, 2016, Pages 4-18.

Cited by: 0|Views17


In the Fixed Cost -Flow problem, we are given a graph = (, ) with edge-capacities { ∣ ∈ } and edge-costs { ∣ ∈ }, source-sink pair , ∈ , and an integer . The goal is to find a minimum cost subgraph of such that the minimum capacity of an -cut in is at least . By an approximation-preserving reduction from Group Steiner Tree problem to...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 :