Kinetic Maintenance of Mobile k-Centres on Trees

DOI10.1007/978-3-540-77120-3_31zbMATH Open1193.68083OpenAlexW1509408808MaRDI QIDQ5387769FDOQ5387769

Christophe Paul, Stephane Durocher

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_31

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
• Discrete mobile centers
• Smooth kinetic maintenance of clusters
• Deformable spanners and applications
• Data Structures for Mobile Data
• Finding the upper envelope of n line segments in O(n log n) time
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• Maintaining approximate extent measures of moving points
• BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
• Maintaining the extent of a moving point set
• Algorithms for the m-center problems: A survey
• The absolute center of a network

Cited In (1)

• Kinetic maintenance of mobile \(k\)-centres on trees

This page was built for publication: Kinetic Maintenance of Mobile k-Centres on Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387769)