A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem

We investigate a metric facility location problem in a distributed setting. In this problem, we assume that each point is a client as well as a potential location for a facility and that the opening costs for the facilities and the demands of the clients are uniform. The goal is to open a subset of...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 68; no. 3; pp. 643 - 670
Main Authors:	Gehweiler, Joachim, Lammersen, Christiane, Sohler, Christian
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.03.2014 Springer
Subjects:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer systems and distributed systems. User interface Computer Systems Organization and Communication Networks Data Structures and Information Theory Exact sciences and technology Information retrieval. Graph Logistics Mathematics of Computing Operational research and scientific management Operational research. Management science Software Theoretical computing Theory of Computation Facility location Randomized approximation algorithm Synchronous message passing model Distributed algorithm Costs Metric space Distributed system Approximation algorithm Randomized algorithm Modeling Location problem Randomized design Message passing Gossiping(all to all) Metric Graph method Message transmission
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!