Optimal facility location under various distance functions

Sergei Bespamyatnikh, Klara Kedem, Michael Segal

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations


We present efficient algorithms for two problems of facility location. In both problems we want to determine the location of a single facility with respect to n given sites. In the first we seek a location that maximizes a weighted distance function between the facility and the sites, and in the second we find a location that minimizes the sum (or sum of the squares) of the distances of k of the sites from the facility.

Original languageEnglish
Title of host publicationAlgorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings
EditorsFrank Dehne, Jorg-Rudiger Sack, Arvind Gupta, Roberto Tamassia
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540662790, 9783540662792
StatePublished - 1 Jan 1999
Event6th International Workshop on Algorithms and Data Structures, WADS 1999 - Vancouver, Canada
Duration: 11 Aug 199914 Aug 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference6th International Workshop on Algorithms and Data Structures, WADS 1999

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Optimal facility location under various distance functions'. Together they form a unique fingerprint.

Cite this