Sciweavers

Share
CORR
2008
Springer

Packing multiway cuts in capacitated graphs

9 years 1 months ago
Packing multiway cuts in capacitated graphs
We consider the following "multiway cut packing" problem in undirected graphs: we are given a graph G = (V, E) and k commodities, each corresponding to a set of terminals located at different vertices in the graph; our goal is to produce a collection of cuts {E1,
Siddharth Barman, Shuchi Chawla
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Siddharth Barman, Shuchi Chawla
Comments (0)
books