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,

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Siddharth Barman, Shuchi Chawla
• Keywords: CORR 2008, Cut Packing, Education, Multiway Cut Packing, Undirected Graphs