暂无分享,去创建一个
[1] Gary L. Miller,et al. Improved Parallel Algorithms for Spanners and Hopsets , 2015, SPAA.
[2] A. Kemper,et al. On Graph Problems in a Semi-streaming Model , 2015 .
[3] Michael Elkin,et al. Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models , 2004, PODC '04.
[4] James B. Orlin,et al. A faster strongly polynomial minimum cost flow algorithm , 1993, STOC '88.
[5] Edith Cohen,et al. Polylog-time and near-linear work approximation scheme for undirected shortest paths , 1994, STOC '94.
[6] Joan Feigenbaum,et al. Graph Distances in the Data-Stream Model , 2008, SIAM J. Comput..
[7] Daniel A. Spielman,et al. Faster approximate lossy generalized flow via interior point algorithms , 2008, STOC.
[8] Surender Baswana,et al. Streaming algorithm for graph spanners - single pass and constant processing time per edge , 2008, Inf. Process. Lett..
[9] T. Lindvall. ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.
[10] Richard M. Karp,et al. Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[11] Michael Elkin,et al. Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners , 2007, TALG.
[12] Christoph Lenzen,et al. Algebraic methods in the congested clique , 2015, Distributed Computing.
[13] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[14] Danupon Nanongkai,et al. Distributed approximation algorithms for weighted shortest paths , 2014, STOC.
[15] Sandeep Sen,et al. A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs , 2007, Random Struct. Algorithms.
[16] Yin Tat Lee,et al. An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations , 2013, SODA.
[17] Shang-Hua Teng,et al. Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs , 2010, STOC '11.
[18] Monika Henzinger,et al. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths , 2015, STOC.
[19] James B. Orlin. A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..
[20] Michael Elkin. An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem , 2006, SIAM J. Comput..
[21] Boaz Patt-Shamir,et al. Fast Routing Table Construction Using Small Messages , 2012, ArXiv.
[22] Jonah Sherman,et al. Generalized Preconditioning and Network Flow Problems , 2016, ArXiv.
[23] 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.
[24] 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).
[25] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[26] Mikkel Thorup,et al. Undirected single-source shortest paths with positive integer weights in linear time , 1999, JACM.
[27] Jonah Sherman,et al. Nearly Maximum Flows in Nearly Linear Time , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[28] Boaz Patt-Shamir,et al. Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds , 2005, SIAM J. Comput..
[29] Mikkel Thorup,et al. Deterministic Constructions of Approximate Distance Oracles and Spanners , 2005, ICALP.
[30] Venkatesan Guruswami,et al. Superlinear Lower Bounds for Multipass Graph Processing , 2013, Computational Complexity Conference.
[31] 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.