Lower and upper bounds for tracking mobile users

Sergei Bespamyatnikh, Binay Bhattacharya, David Kirkpatrick, Michael Segal

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

3 Scopus citations

Abstract

In this paper we prove improved lower and upper bounds for the location of mobile facilities (in L and L2 metrics) under the motion of clients when facility moves faster than clients. This paper continues the research started in our joint paper where we present lower bounds and efficient algorithms for exact and approximate maintenance of the 1-center for a set of moving points in the plane. Our algorithms are based on the kinetic framework introduced by Basch, Guibas and Hershberger.

Original languageEnglish
Title of host publicationFoundations of Information Technology in the Era of Network and Mobile Computing - IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP Int. Conference on Theoretical Computer Science (TCS 2002)
EditorsR. Baeza-Yates, U. Montanari, N. Santoro
PublisherKluwer Academic Publishers
Pages47-58
Number of pages12
ISBN (Print)9781475752755
DOIs
StatePublished - 1 Jan 2002
EventIFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002 - Montreal, QC, Canada
Duration: 25 Aug 200230 Aug 2002

Publication series

NameIFIP Advances in Information and Communication Technology
Volume96
ISSN (Print)1868-4238

Conference

ConferenceIFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002
Country/TerritoryCanada
CityMontreal, QC
Period25/08/0230/08/02

Fingerprint

Dive into the research topics of 'Lower and upper bounds for tracking mobile users'. Together they form a unique fingerprint.

Cite this