A distributed O(1)-approximation algorithm for the uniform facility location problem
type: Item
instance of: scholarly article
title: A distributed O(1)-approximation algorithm for the uniform facility location problem
zbMATH Open document ID: 1360.68893
author: Joachim Gehweiler
author: Christiane Lammersen
author: Christian Sohler
published in: Algorithmica
publication date: 2017-05-17T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6718308
zbMATH Keywords: facility location
zbMATH Keywords: distributed algorithm
zbMATH Keywords: randomized approximation algorithm
zbMATH Keywords: synchronous message passing model
MaRDI profile type: Publication
full work available at URL: s00453-012-9690-y
OpenAlex ID: W1973201650
cites work: Local Search Heuristics for k-Median and Facility Location Problems
cites work: Automata, Languages and Programming
cites work: An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
cites work: Improved Combinatorial Algorithms for Facility Location Problems
cites work: Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
cites work: A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
cites work: Greedy Strikes Back: Improved Facility Location Algorithms
cites work: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
cites work: A new greedy approach for facility location problems
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: Analysis of a Local Search Heuristic for Facility Location Problems
cites work: Q3126969
cites work: Approximation Algorithms for Metric Facility Location Problems
cites work: The Online Median Problem
cites work: Facility location
cites work: Return of the primal-dual
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: Q4526991
cites work: Q4737531
cites work: Quick k-Median, k-Center, and Facility Location for Sparse Graphs
DOI: 10.1007/S00453-012-9690-Y
description: scientific article; zbMATH DE number 6718308