Rectilinear static and dynamic discrete 2-center problems

Sergei Bespamyatnikh, Michael Segal

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

10 Scopus citations

Abstract

In this paper we consider several variants of the discrete 2-center problem. The problem is: Given a set S of n demand points and a set C of m supply points, find two “minimal” axis-parallel squares (or rectangles) centered at the points of C that cover all the points of S. We present efficient solutions for both the static and dynamic versions of the problem (i.e. points of S are allowed to be inserted or deleted) and also consider the problem in fixed d; d ≥ 3 dimensional space. For the static version in the plane we give an optimal algorithm.

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
Pages276-287
Number of pages12
ISBN (Print)3540662790, 9783540662792
DOIs
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)
Volume1663
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Workshop on Algorithms and Data Structures, WADS 1999
Country/TerritoryCanada
CityVancouver
Period11/08/9914/08/99

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Rectilinear static and dynamic discrete 2-center problems'. Together they form a unique fingerprint.

Cite this