Sub-logarithmic distributed algorithms for metric facility location

DOI10.1007/s00446-015-0243-xzbMath1342.68350OpenAlexW2087568912MaRDI QIDQ748120

James W. Hegeman, Sriram V. Pemmaraju

Publication date: 20 October 2015

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-015-0243-x

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (2)

Unnamed Item ⋮ Near-optimal clustering in the \(k\)-machine model

Uses Software

• Pregel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A distributed O(1)-approximation algorithm for the uniform facility location problem
• The round complexity of distributed sorting
• On the power of the congested clique model
• A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
• Super-Fast Distributed Algorithms for Metric Facility Location
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• A Plant and Warehouse Location Problem
• Distributed Computing: A Locality-Sensitive Approach
• The Online Median Problem
• Return of the primal-dual
• Optimal deterministic routing and sorting on the congested clique
• Rapid randomized pruning for fast greedy distributed algorithms
• Facility location
• Distributed Computation of Large-scale Graph Problems
• Tight bounds for parallel randomized load balancing
• Lessons from the Congested Clique Applied to MapReduce
• Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
• Automata, Languages and Programming
• Distributed MST for constant diameter graphs

This page was built for publication: Sub-logarithmic distributed algorithms for metric facility location