Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions
暂无分享,去创建一个
[1] Chao Xu,et al. Hypergraph k-cut in randomized polynomial time , 2018, Mathematical Programming.
[2] Ken-ichi Kawarabayashi,et al. Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time , 2014, STOC.
[3] Chao Xu,et al. Computing minimum cuts in hypergraphs , 2016, SODA.
[4] David R. Karger,et al. Random Contractions and Sampling for Hypergraph and Hedge Connectivity , 2017, SODA.
[5] Mingyu Xiao,et al. Finding minimum 3-way cuts in hypergraphs , 2008, Inf. Process. Lett..
[6] Martin D. F. Wong,et al. A fast hypergraph min-cut algorithm for circuit partitioning , 2000, Integr..
[7] Nagamochi Hiroshi,et al. A Deterministic Algorithm for Finding All Minimum k-Way Cuts , 2005 .
[8] Frank Wagner,et al. A simple hypergraph min cut algorithm , 1996 .
[9] Shin'ichi Wakabayashi,et al. A Divide-and-Conquer Approach to the Minimum k -Way Cut Problem , 2001, Algorithmica.
[10] Robert Krauthgamer,et al. Sketching Cuts in Graphs and Hypergraphs , 2014, ITCS.
[11] Anupam Gupta,et al. Faster Exact and Approximate Algorithms for k-Cut , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[12] David R. Karger,et al. A new approach to the minimum cut problem , 1996, JACM.
[13] Maurice Queyranne,et al. Minimizing symmetric submodular functions , 1998, Math. Program..
[14] Mingyu Xiao,et al. An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts , 2008, ISAAC.
[15] Toshihide Ibaraki,et al. Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..
[16] Mechthild Stoer,et al. A simple min-cut algorithm , 1997, JACM.
[17] Dorit S. Hochbaum,et al. A Polynomial Algorithm for the k-cut Problem for Fixed k , 1994, Math. Oper. Res..
[18] Mikkel Thorup,et al. Minimum k-way cuts via deterministic greedy tree packing , 2008, STOC.
[19] Kent Quanrud,et al. LP Relaxation and Tree Packing for Minimum k-cuts , 2018, SOSA.
[20] David R. Karger,et al. Global min-cuts in RNC, and other ramifications of a simple min-out algorithm , 1993, SODA '93.
[21] Takuro Fukunaga,et al. Computing minimum multiway cuts in hypergraphs , 2013, Discret. Optim..
[22] David R. Karger,et al. Minimum cuts in near-linear time , 1998, JACM.