Sciweavers

2 search results - page 1 / 1
» Packing multiway cuts in capacitated graphs
Sort
View
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 9 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 terminal...
Siddharth Barman, Shuchi Chawla
IPCO
2010
184views Optimization» more  IPCO 2010»
13 years 10 months ago
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
Takuro Fukunaga