itcs.shufe.edu.cn
VISITORS - Institute for Theoretical Computer Science, SUFE 上海财经大学理论计算机科学研究中心
http://itcs.shufe.edu.cn/index.php/visitors
CONFERENCES & WORKSHOPS. SUMMER & WINTER SCHOOLS. The Weizmann Institute of Science. Queen Mary, University of London. University of Illinois at Urbana-Champaign. University of New South Wales. Queen Mary, University of London. IIIS, Tsinghua University. Institute of Information Science, Academia Sinica. Shanghai Jiao Tong University. Hong Kong Polytechnic University. Institute of Software, Chinese Academy of Sciences. California Institute of Technology. University of British Columbia.
itcs.shufe.edu.cn
HOME - Institute for Theoretical Computer Science, SUFE 上海财经大学理论计算机科学研究中心
http://itcs.shufe.edu.cn/index.php/home
CONFERENCES & WORKSHOPS. SUMMER & WINTER SCHOOLS. Local max-cut in smoothed polynomial time (Fan Wei. Approximating Survivable Network Design via Rounding-by-Tree-Embedding (Bundit Laekhanukit). Constrained Counting and Sampling: Bridging the Gap between Theory and Practice (Kuldeep Meel). How to find relations between two networks? Computing minimum cuts in hypergraphs (Chao Xu). Distributed matrix sketching (Zengfeng Huang). SUMMER and WINTER SCHOOLS. 201607.04 - 2016.07.07. Shanghai Theory Day 2016.
itcs.shufe.edu.cn
Computing minimum cuts in hypergraphs (Chao Xu) - Institute for Theoretical Computer Science, SUFE 上海财经大学理论计算机科学研究中心
http://itcs.shufe.edu.cn/index.php/computing-minimum-cuts-in-hypergraphs-chao-xu
CONFERENCES & WORKSHOPS. SUMMER & WINTER SCHOOLS. Computing minimum cuts in hypergraphs (Chao Xu). Given a hypergraph H = (V, E) with n = V , m = E and p = sum of degrees, the fastest known algorithm to compute a global minimum cut in H runs in O(np n 2 log n) time. The talk is based on a joint work with Chandra Chekuri. The latest version can be found at https:/ arxiv.org/abs/1607.08682. University of Illinois at Urbana-Champaign. No 100, Wudong Road, Yangpu District, Shanghai, 200433, PRC.
