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

DOI10.1016/J.DAM.2008.10.006zbMATH Open1172.05019OpenAlexW2036599050MaRDI QIDQ1028114

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
• Lowest common ancestors in trees and directed acyclic graphs
• 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
• 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
• Planar realizations of nonlinear Davenport-Schinzel sequences by segments
• The upper envelope of piecewise linear functions: Algorithms and applications
• Maintaining the extent of a moving point set
• \(H\)-convex graphs
• Algorithms for the m-center problems: A survey
• Smooth kinetic maintenance of clusters
• The absolute center of a network

Recommendations

• Centers for Random Walks on Trees 👍 👎
• Kinetic Euclidean minimum spanning tree in the plane 👍 👎
• Kinetic Euclidean Minimum Spanning Tree in the Plane 👍 👎
• Properties of thek-centra in a tree network 👍 👎
• Topological stability of kinetic \(k\)-centers 👍 👎
• Persistence of centrality in random growing trees 👍 👎
• Topological Stability of Kinetic k-centers 👍 👎
• The $p$-Center Problem in Tree Networks Revisited 👍 👎
• Kinetic Maintenance of Mobile k-Centres on Trees 👍 👎
• Title not available (Why is that?) 👍 👎

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)