论文信息 - Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs - 字舞流文

Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs

We show that many distributed network optimization problems can be solved much more efficiently in structured and topologically simple networks.

Bernhard Haeupler | Taisuke Izumi | Goran Zuzic | Bernhard Haeupler | Taisuke Izumi | Goran Zuzic

[1] Bernhard Haeupler,et al. Low-Congestion shortcuts without embedding , 2016, Distributed Computing.

[2] Boaz Patt-Shamir,et al. Fast Partial Distance Estimation and Applications , 2014, PODC.

[3] Boaz Patt-Shamir,et al. Near-Optimal Distributed Maximum Flow: Extended Abstract , 2015, PODC.

[4] Bernhard Haeupler,et al. Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut , 2016, SODA.

[5] David Peleg,et al. Distributed verification and hardness of distributed approximation , 2010, STOC '11.

[6] Hsin-Hao Su,et al. Almost-Tight Distributed Minimum Cut Algorithms , 2014, DISC.

[7] David Eppstein,et al. Dynamic generators of topologically embedded graphs , 2002, SODA '03.

[8] Shay Kutten,et al. Fast distributed construction of k-dominating sets and applications , 1995, PODC '95.

[9] Christoph Lenzen,et al. What can be approximated locally?: case study: dominating sets in planar graphs , 2008, SPAA '08.

[10] Roger Wattenhofer,et al. On the locality of bounded growth , 2005, PODC '05.

[11] Torben Hagerup,et al. Parallel Algorithms with Optimal Speedup for Bounded Treewidth , 1995, SIAM J. Comput..

[12] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .

[13] Bernhard Haeupler,et al. Distributed Algorithms for Planar Networks I: Planar Embedding , 2016, PODC.