On mimicking networks representing minimum terminal cuts
A Khan, P Raghavendra - Information Processing Letters, 2014 - Elsevier
Given a capacitated undirected graph G=(V, E) with a set of terminals K⊂ V, a mimicking
network is a smaller graph H=(VH, EH) which contains the set of terminals K and for every
bipartition [U, K− U] of the terminals, the cost of the minimum cut separating U from K− U in G
is exactly equal to the cost of the minimum cut separating U from K− U in H. In this work, we
improve both the previous known upper bound of 2 2 k [1] and lower bound of (k+ 1)[2] for
mimicking networks, reducing the doubly-exponential gap between them to a single …
network is a smaller graph H=(VH, EH) which contains the set of terminals K and for every
bipartition [U, K− U] of the terminals, the cost of the minimum cut separating U from K− U in G
is exactly equal to the cost of the minimum cut separating U from K− U in H. In this work, we
improve both the previous known upper bound of 2 2 k [1] and lower bound of (k+ 1)[2] for
mimicking networks, reducing the doubly-exponential gap between them to a single …
Showing the best result for this search. See all results