A Practical Parallel Algorithm for Diameter Approximation of Massive
Weighted Graphs

v1v2v3 (latest)

A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs

10 June 2015

Matteo Ceccarello

A. Pietracaprina

ArXiv (abs)PDF HTML

Papers citing "A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs"

4 / 4 papers shown

Title
Towards Distributed 2-Approximation Steiner Minimal Trees in Billion-edge Graphs Tahsin Reza Geoffrey Sanders Roger Pearce 15 1 0 28 May 2022
Greedy k-Center from Noisy Distance Samples Neharika Jali Nikhil Karamchandani Sharayu Moharir 34 2 0 03 Nov 2020
Solving $k$ -center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially Matteo Ceccarello A. Pietracaprina G. Pucci 69 65 0 26 Feb 2018
MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension Matteo Ceccarello A. Pietracaprina G. Pucci E. Upfal 47 34 0 18 May 2016