ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1602.02293
  4. Cited By
On Efficient Distributed Construction of Near Optimal Routing Schemes
v1v2 (latest)

On Efficient Distributed Construction of Near Optimal Routing Schemes

6 February 2016
Michael Elkin
Ofer Neiman
ArXiv (abs)PDFHTML

Papers citing "On Efficient Distributed Construction of Near Optimal Routing Schemes"

2 / 2 papers shown
Title
Minor Sparsifiers and the Distributed Laplacian Paradigm
Minor Sparsifiers and the Distributed Laplacian Paradigm
S. Forster
Gramoz Goranci
Yang P. Liu
Richard Peng
Xiaorui Sun
Mingquan Ye
53
22
0
31 Dec 2020
A Deterministic Almost-Tight Distributed Algorithm for Approximating
  Single-Source Shortest Paths
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
Monika Henzinger
Sebastian Krinninger
Danupon Nanongkai
104
112
0
27 Apr 2015
1