Kinetic maintenance of mobile k-centres on trees

DOI10.1016/J.DAM.2008.10.006MaRDI QIDQ1028114zbMATH OpenOpenAlexFDO

Authors Stephane Durocher, Christophe Paul

Publication date 30 June 2009

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2008.10.006

zbMATH Keywords

algorithmstreeskinetic data structures\(k\)-centre

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Recommendations

• Kinetic Maintenance of Mobile k-Centres on Trees
• Centers for random walks on trees
• Properties of thek-centra in a tree network
• Kinetic Euclidean minimum spanning tree in the plane
• Kinetic Euclidean minimum spanning tree in the plane
• scientific article; zbMATH DE number 1947377
• Topological stability of kinetic \(k\)-centers
• Topological stability of kinetic \(k\)-centers
• Persistence of centrality in random growing trees
• The \(p\)-center problem in tree networks revisited

Cites work

• scientific article; zbMATH DE number 3847184 (Why is no real title available?)
• scientific article; zbMATH DE number 4003873 (Why is no real title available?)
• scientific article; zbMATH DE number 177557 (Why is no real title available?)
• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• scientific article; zbMATH DE number 1501063 (Why is no real title available?)
• Algorithms for the m-center problems: A survey
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
• Data Structures for Mobile Data
• Deformable spanners and applications
• Discrete mobile centers
• Finding the upper envelope of n line segments in O(n log n) time
• Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
• Lowest common ancestors in trees and directed acyclic graphs
• Maintaining approximate extent measures of moving points
• Maintaining the extent of a moving point set
• Planar realizations of nonlinear Davenport-Schinzel sequences by segments
• Smooth kinetic maintenance of clusters
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION
• The absolute center of a network
• The upper envelope of piecewise linear functions: Algorithms and applications
• \(H\)-convex graphs

Cited in

(7)

• Kinetic facility location
• Kinetic Maintenance of Mobile k-Centres on Trees
• The Kinetic Facility Location Problem
• BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES
• Kinetic 2-centers in the black-box model
• Topological stability of kinetic \(k\)-centers
• Topological stability of kinetic \(k\)-centers

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 Q1028114)