Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
暂无分享,去创建一个
Christoph Lenzen | Sebastian Krinninger | Andreas Karrenbauer | Ruben Becker | A. Karrenbauer | C. Lenzen | R. Becker | S. Krinninger | Sebastian Krinninger | Andreas Karrenbauer
[1] Michael Elkin,et al. Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models , 2004, PODC '04.
[2] Jesper Larsson Träff,et al. A Parallel Priority Queue with Constant Time Operations , 1998, J. Parallel Distributed Comput..
[3] Boaz Patt-Shamir,et al. Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds , 2005, SIAM J. Comput..
[4] Mikkel Thorup,et al. Deterministic Constructions of Approximate Distance Oracles and Spanners , 2005, ICALP.
[5] Venkatesan Guruswami,et al. Superlinear Lower Bounds for Multipass Graph Processing , 2013, Computational Complexity Conference.
[6] Joan Feigenbaum,et al. Graph Distances in the Data-Stream Model , 2008, SIAM J. Comput..
[7] Thomas H. Spencer,et al. Time-work tradeoffs for parallel algorithms , 1997, JACM.
[8] Edith Cohen,et al. Polylog-time and near-linear work approximation scheme for undirected shortest paths , 1994, STOC '94.
[9] Shang-Hua Teng,et al. Lower-stretch spanning trees , 2004, STOC '05.
[10] T. Lindvall. ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.
[11] Danupon Nanongkai,et al. A Faster Distributed Single-Source Shortest Paths Algorithm , 2017, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[12] Michael Elkin,et al. Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners , 2007, TALG.
[13] Edith Cohen. Using Selective Path-Doubling for Parallel Shortest-Path Computations , 1997, J. Algorithms.
[14] Christoph Lenzen,et al. Algebraic methods in the congested clique , 2015, Distributed Computing.
[15] Yin Tat Lee,et al. An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations , 2013, SODA.
[16] Surender Baswana,et al. Streaming algorithm for graph spanners - single pass and constant processing time per edge , 2008, Inf. Process. Lett..
[17] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[18] Seth Pettie,et al. Thorup-Zwick Emulators are Universally Optimal Hopsets , 2017, Inf. Process. Lett..
[19] Richard M. Karp,et al. Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[20] Haim Kaplan,et al. Hollow Heaps , 2015, ICALP.
[21] Michael Elkin,et al. Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC , 2019, Distributed Computing.
[22] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[23] Michael Elkin. An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem , 2006, SIAM J. Comput..
[24] A. Madry,et al. Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ(m 10/7 log W) Time. , 2016 .
[25] Philip N. Klein,et al. A Randomized Parallel Algorithm for Single-Source Shortest Paths , 1997, J. Algorithms.
[26] L FredmanMichael,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987 .
[27] Peter Sanders,et al. [Delta]-stepping: a parallelizable shortest path algorithm , 2003, J. Algorithms.
[28] Michael Elkin,et al. Linear-Size Hopsets with Small Hopbound, and Distributed Routing with Low Memory , 2017, ArXiv.
[29] A. Kemper,et al. On Graph Problems in a Semi-streaming Model , 2015 .
[30] Yin Tat Lee,et al. Path Finding Methods for Linear Programming: Solving Linear Programs in Õ(vrank) Iterations and Faster Algorithms for Maximum Flow , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[31] Michael Elkin,et al. Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[32] M. R. Rao,et al. Combinatorial Optimization , 1992, NATO ASI Series.
[33] Shang-Hua Teng,et al. Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs , 2010, STOC '11.
[34] Monika Henzinger,et al. Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[35] François Le Gall,et al. Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems , 2016, DISC.
[36] Monika Henzinger,et al. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths , 2015, STOC.
[37] Aleksander Madry,et al. Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[38] Yair Bartal,et al. On approximating arbitrary metrices by tree metrics , 1998, STOC '98.
[39] Michael Elkin,et al. Efficient algorithms for constructing (1+∊,β)-spanners in the distributed and streaming models , 2006, Distributed Computing.
[40] Daniel A. Spielman,et al. Faster approximate lossy generalized flow via interior point algorithms , 2008, STOC.
[41] Keren Censor-Hillel,et al. Fast approximate shortest paths in the congested clique , 2019, Distributed Computing.
[42] Andrew V. Goldberg,et al. Scaling algorithms for the shortest paths problem , 1995, SODA '93.
[43] James B. Orlin,et al. A faster strongly polynomial minimum cost flow algorithm , 1993, STOC '88.
[44] Mikkel Thorup,et al. Undirected single-source shortest paths with positive integer weights in linear time , 1999, JACM.
[45] Seth Pettie,et al. A Hierarchy of Lower Bounds for Sublinear Additive Spanners , 2016, SODA.
[46] Mohsen Ghaffari,et al. Improved distributed algorithms for exact shortest paths , 2018, STOC.
[47] Jonah Sherman,et al. Generalized Preconditioning and Network Flow Problems , 2016, ArXiv.
[48] Thomas H. Spencer,et al. Time-Work Tradeoffs of the Single-Source Shortest Paths Problem , 1999, J. Algorithms.
[49] Michael Elkin,et al. Distributed exact shortest paths in sublinear time , 2017, STOC.
[50] Aaron Bernstein,et al. Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[51] Gary L. Miller,et al. Improved Parallel Algorithms for Spanners and Hopsets , 2015, SPAA.
[52] Guy E. Blelloch,et al. Parallel Shortest Paths Using Radius Stepping , 2016, SPAA.
[53] Jonah Sherman,et al. Nearly Maximum Flows in Nearly Linear Time , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[54] Boaz Patt-Shamir,et al. Fast Routing Table Construction Using Small Messages , 2012, ArXiv.
[55] Sandeep Sen,et al. A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs , 2007, Random Struct. Algorithms.
[56] L. R. Ford,et al. NETWORK FLOW THEORY , 1956 .
[57] James B. Orlin. A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..
[58] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[59] Danupon Nanongkai,et al. Distributed approximation algorithms for weighted shortest paths , 2014, STOC.